Theorem disjssun 2316

Description: Subset relation for disjoint classes.

Assertion

Ref	Expression
disjssun	|- ((A i^i B) = (/) -> (A (_ (B u. C) <-> A (_ C))

Proof of Theorem disjssun

Step	Hyp	Ref	Expression
1		disj1 2302	. . . . . . 7 |- ((A i^i B) = (/) <-> A.x(x e. A -> -. x e. B))
2		ax-4 970	. . . . . . 7 |- (A.x(x e. A -> -. x e. B) -> (x e. A -> -. x e. B))
3	1, 2	sylbi 199	. . . . . 6 |- ((A i^i B) = (/) -> (x e. A -> -. x e. B))
4	3	imp 350	. . . . 5 |- (((A i^i B) = (/) /\ x e. A) -> -. x e. B)
5		biorf 733	. . . . 5 |- (-. x e. B -> (x e. C <-> (x e. B \/ x e. C)))
6	4, 5	syl 10	. . . 4 |- (((A i^i B) = (/) /\ x e. A) -> (x e. C <-> (x e. B \/ x e. C)))
7		elun 2163	. . . 4 |- (x e. (B u. C) <-> (x e. B \/ x e. C))
8	6, 7	syl6rbbr 537	. . 3 |- (((A i^i B) = (/) /\ x e. A) -> (x e. (B u. C) <-> x e. C))
9	8	ralbidva 1651	. 2 |- ((A i^i B) = (/) -> (A.x e. A x e. (B u. C) <-> A.x e. A x e. C))
10		dfss3 2049	. 2 |- (A (_ (B u. C) <-> A.x e. A x e. (B u. C))
11		dfss3 2049	. 2 |- (A (_ C <-> A.x e. A x e. C)
12	9, 10, 11	3bitr4g 553	1 |- ((A i^i B) = (/) -> (A (_ (B u. C) <-> A (_ C))

Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   \/ wo 222   /\ wa 223  A.wal 951   = wceq 953   e. wcel 955  A.wral 1637   u. cun 2035   i^i cin 2036   (_ wss 2037  (/)c0 2270

This theorem is referenced by:  ssxr 5513  cnfilca 10451

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-12 965  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-clab 1457  df-cleq 1462  df-clel 1465  df-ral 1641  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271

Copyright terms: Public domain