addcexg - New Foundations Explorer

	New Foundations Explorer		< Previous Next > Nearby theorems
Mirrors > Home > NFE Home > Th. List > addcexg		GIF version

Theorem addcexg 4393

Description: The cardinal sum of two sets is a set. (Contributed by SF, 15-Jan-2015.)

**Assertion**
Ref	Expression
addcexg	⊢ ((A ∈ V ∧ B ∈ W) → (A +_c B) ∈ V)

**Proof of Theorem addcexg**
Step	Hyp	Ref	Expression
1		dfaddc2 4381	. 2 ⊢ (A +_c B) = ((( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) “_k A)
2		pw1exg 4302	. . . . 5 ⊢ (B ∈ W → ℘₁B ∈ V)
3		pw1exg 4302	. . . . 5 ⊢ (℘₁B ∈ V → ℘₁℘₁B ∈ V)
4		addcexlem 4382	. . . . . 6 ⊢ ( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) ∈ V
5		imakexg 4299	. . . . . 6 ⊢ ((( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) ∈ V ∧ ℘₁℘₁B ∈ V) → (( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) ∈ V)
6	4, 5	mpan 651	. . . . 5 ⊢ (℘₁℘₁B ∈ V → (( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) ∈ V)
7	2, 3, 6	3syl 18	. . . 4 ⊢ (B ∈ W → (( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) ∈ V)
8		imakexg 4299	. . . 4 ⊢ (((( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) ∈ V ∧ A ∈ V) → ((( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) “_k A) ∈ V)
9	7, 8	sylan 457	. . 3 ⊢ ((B ∈ W ∧ A ∈ V) → ((( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) “_k A) ∈ V)
10	9	ancoms 439	. 2 ⊢ ((A ∈ V ∧ B ∈ W) → ((( Ins3_k ∼ (( Ins3_k S_k ∩ Ins2_k S_k ) “_k ℘₁℘₁1_c) ∖ (( Ins2_k Ins2_k S_k ⊕ ( Ins2_k Ins3_k S_k ∪ Ins3_k SI_k SI_k S_k )) “_k ℘₁℘₁℘₁℘₁1_c)) “_k ℘₁℘₁B) “_k A) ∈ V)
11	1, 10	syl5eqel 2437	1 ⊢ ((A ∈ V ∧ B ∈ W) → (A +_c B) ∈ V)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 358 ∈ wcel 1710 Vcvv 2859 ∼ ccompl 3205 ∖ cdif 3206 ∪ cun 3207 ∩ cin 3208 ⊕ csymdif 3209 1_cc1c 4134 ℘₁cpw1 4135 Ins2_k cins2k 4176 Ins3_k cins3k 4177 “_k cimak 4179 SI_k csik 4181 S_k cssetk 4183 +_c cplc 4375

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 ax-nin 4078 ax-xp 4079 ax-cnv 4080 ax-1c 4081 ax-sset 4082 ax-si 4083 ax-ins2 4084 ax-ins3 4085 ax-typlower 4086 ax-sn 4087

This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-3an 936 df-nan 1288 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2478 df-ne 2518 df-ral 2619 df-rex 2620 df-v 2861 df-nin 3211 df-compl 3212 df-in 3213 df-un 3214 df-dif 3215 df-symdif 3216 df-ss 3259 df-nul 3551 df-pw 3724 df-sn 3741 df-pr 3742 df-opk 4058 df-1c 4136 df-pw1 4137 df-xpk 4185 df-cnvk 4186 df-ins2k 4187 df-ins3k 4188 df-imak 4189 df-p6 4191 df-sik 4192 df-ssetk 4193 df-addc 4378

This theorem is referenced by: addcex 4394 lefinaddc 4450 leltfintr 4458 ltfinp1 4462 sucevenodd 4510 sucoddeven 4511 addlec 6208 fnfreclem3 6319

W3C validator