Theorem ncdisjun 6136

Description: Cardinality of disjoint union of two sets. (Contributed by SF, 24-Feb-2015.)

Hypotheses

Ref	Expression
ncdisjun.1	⊢ A ∈ V
ncdisjun.2	⊢ B ∈ V

Assertion

Ref	Expression
ncdisjun	⊢ ((A ∩ B) = ∅ → Nc (A ∪ B) = ( Nc A +c Nc B))

Proof of Theorem ncdisjun

Dummy variables p q r x are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnc 6125	. . 3 ⊢ (x ∈ Nc (A ∪ B) ↔ x ≈ (A ∪ B))
2		bren 6030	. . . . 5 ⊢ (x ≈ (A ∪ B) ↔ ∃r r:x–1-1-onto→(A ∪ B))
3		f1ocnv 5299	. . . . . . 7 ⊢ (r:x–1-1-onto→(A ∪ B) → ◡r:(A ∪ B)–1-1-onto→x)
4		imaundi 5039	. . . . . . . . . . 11 ⊢ (◡r “ (A ∪ B)) = ((◡r “ A) ∪ (◡r “ B))
5		imadmrn 5008	. . . . . . . . . . . . 13 ⊢ (◡r “ dom ◡r) = ran ◡r
6	5	a1i 10	. . . . . . . . . . . 12 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ dom ◡r) = ran ◡r)
7		f1odm 5290	. . . . . . . . . . . . 13 ⊢ (◡r:(A ∪ B)–1-1-onto→x → dom ◡r = (A ∪ B))
8	7	imaeq2d 4942	. . . . . . . . . . . 12 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ dom ◡r) = (◡r “ (A ∪ B)))
9		f1ofo 5293	. . . . . . . . . . . . 13 ⊢ (◡r:(A ∪ B)–1-1-onto→x → ◡r:(A ∪ B)–onto→x)
10		forn 5272	. . . . . . . . . . . . 13 ⊢ (◡r:(A ∪ B)–onto→x → ran ◡r = x)
11	9, 10	syl 15	. . . . . . . . . . . 12 ⊢ (◡r:(A ∪ B)–1-1-onto→x → ran ◡r = x)
12	6, 8, 11	3eqtr3d 2393	. . . . . . . . . . 11 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ (A ∪ B)) = x)
13	4, 12	syl5eqr 2399	. . . . . . . . . 10 ⊢ (◡r:(A ∪ B)–1-1-onto→x → ((◡r “ A) ∪ (◡r “ B)) = x)
14	13	adantl 452	. . . . . . . . 9 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → ((◡r “ A) ∪ (◡r “ B)) = x)
15		f1of1 5286	. . . . . . . . . . . . . 14 ⊢ (◡r:(A ∪ B)–1-1-onto→x → ◡r:(A ∪ B)–1-1→x)
16		ssun1 3426	. . . . . . . . . . . . . 14 ⊢ A ⊆ (A ∪ B)
17		f1ores 5300	. . . . . . . . . . . . . 14 ⊢ ((◡r:(A ∪ B)–1-1→x ∧ A ⊆ (A ∪ B)) → (◡r ↾ A):A–1-1-onto→(◡r “ A))
18	15, 16, 17	sylancl 643	. . . . . . . . . . . . 13 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r ↾ A):A–1-1-onto→(◡r “ A))
19		f1ocnv 5299	. . . . . . . . . . . . 13 ⊢ ((◡r ↾ A):A–1-1-onto→(◡r “ A) → ◡(◡r ↾ A):(◡r “ A)–1-1-onto→A)
20		vex 2862	. . . . . . . . . . . . . . . . 17 ⊢ r ∈ V
21	20	cnvex 5102	. . . . . . . . . . . . . . . 16 ⊢ ◡r ∈ V
22		ncdisjun.1	. . . . . . . . . . . . . . . 16 ⊢ A ∈ V
23	21, 22	resex 5117	. . . . . . . . . . . . . . 15 ⊢ (◡r ↾ A) ∈ V
24	23	cnvex 5102	. . . . . . . . . . . . . 14 ⊢ ◡(◡r ↾ A) ∈ V
25	24	f1oen 6033	. . . . . . . . . . . . 13 ⊢ (◡(◡r ↾ A):(◡r “ A)–1-1-onto→A → (◡r “ A) ≈ A)
26	18, 19, 25	3syl 18	. . . . . . . . . . . 12 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ A) ≈ A)
27		elnc 6125	. . . . . . . . . . . 12 ⊢ ((◡r “ A) ∈ Nc A ↔ (◡r “ A) ≈ A)
28	26, 27	sylibr 203	. . . . . . . . . . 11 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ A) ∈ Nc A)
29	28	adantl 452	. . . . . . . . . 10 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → (◡r “ A) ∈ Nc A)
30		ssun2 3427	. . . . . . . . . . . . . 14 ⊢ B ⊆ (A ∪ B)
31		f1ores 5300	. . . . . . . . . . . . . 14 ⊢ ((◡r:(A ∪ B)–1-1→x ∧ B ⊆ (A ∪ B)) → (◡r ↾ B):B–1-1-onto→(◡r “ B))
32	15, 30, 31	sylancl 643	. . . . . . . . . . . . 13 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r ↾ B):B–1-1-onto→(◡r “ B))
33		f1ocnv 5299	. . . . . . . . . . . . 13 ⊢ ((◡r ↾ B):B–1-1-onto→(◡r “ B) → ◡(◡r ↾ B):(◡r “ B)–1-1-onto→B)
34		ncdisjun.2	. . . . . . . . . . . . . . . 16 ⊢ B ∈ V
35	21, 34	resex 5117	. . . . . . . . . . . . . . 15 ⊢ (◡r ↾ B) ∈ V
36	35	cnvex 5102	. . . . . . . . . . . . . 14 ⊢ ◡(◡r ↾ B) ∈ V
37	36	f1oen 6033	. . . . . . . . . . . . 13 ⊢ (◡(◡r ↾ B):(◡r “ B)–1-1-onto→B → (◡r “ B) ≈ B)
38	32, 33, 37	3syl 18	. . . . . . . . . . . 12 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ B) ≈ B)
39	38	adantl 452	. . . . . . . . . . 11 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → (◡r “ B) ≈ B)
40		elnc 6125	. . . . . . . . . . 11 ⊢ ((◡r “ B) ∈ Nc B ↔ (◡r “ B) ≈ B)
41	39, 40	sylibr 203	. . . . . . . . . 10 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → (◡r “ B) ∈ Nc B)
42		df-f1 4792	. . . . . . . . . . . . . 14 ⊢ (◡r:(A ∪ B)–1-1→x ↔ (◡r:(A ∪ B)–→x ∧ Fun ◡◡r))
43	42	simprbi 450	. . . . . . . . . . . . 13 ⊢ (◡r:(A ∪ B)–1-1→x → Fun ◡◡r)
44		imain 5172	. . . . . . . . . . . . 13 ⊢ (Fun ◡◡r → (◡r “ (A ∩ B)) = ((◡r “ A) ∩ (◡r “ B)))
45	15, 43, 44	3syl 18	. . . . . . . . . . . 12 ⊢ (◡r:(A ∪ B)–1-1-onto→x → (◡r “ (A ∩ B)) = ((◡r “ A) ∩ (◡r “ B)))
46	45	adantl 452	. . . . . . . . . . 11 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → (◡r “ (A ∩ B)) = ((◡r “ A) ∩ (◡r “ B)))
47		imaeq2 4938	. . . . . . . . . . . . 13 ⊢ ((A ∩ B) = ∅ → (◡r “ (A ∩ B)) = (◡r “ ∅))
48		ima0 5013	. . . . . . . . . . . . 13 ⊢ (◡r “ ∅) = ∅
49	47, 48	syl6eq 2401	. . . . . . . . . . . 12 ⊢ ((A ∩ B) = ∅ → (◡r “ (A ∩ B)) = ∅)
50	49	adantr 451	. . . . . . . . . . 11 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → (◡r “ (A ∩ B)) = ∅)
51	46, 50	eqtr3d 2387	. . . . . . . . . 10 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → ((◡r “ A) ∩ (◡r “ B)) = ∅)
52		eladdci 4399	. . . . . . . . . 10 ⊢ (((◡r “ A) ∈ Nc A ∧ (◡r “ B) ∈ Nc B ∧ ((◡r “ A) ∩ (◡r “ B)) = ∅) → ((◡r “ A) ∪ (◡r “ B)) ∈ ( Nc A +c Nc B))
53	29, 41, 51, 52	syl3anc 1182	. . . . . . . . 9 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → ((◡r “ A) ∪ (◡r “ B)) ∈ ( Nc A +c Nc B))
54	14, 53	eqeltrrd 2428	. . . . . . . 8 ⊢ (((A ∩ B) = ∅ ∧ ◡r:(A ∪ B)–1-1-onto→x) → x ∈ ( Nc A +c Nc B))
55	54	ex 423	. . . . . . 7 ⊢ ((A ∩ B) = ∅ → (◡r:(A ∪ B)–1-1-onto→x → x ∈ ( Nc A +c Nc B)))
56	3, 55	syl5 28	. . . . . 6 ⊢ ((A ∩ B) = ∅ → (r:x–1-1-onto→(A ∪ B) → x ∈ ( Nc A +c Nc B)))
57	56	exlimdv 1636	. . . . 5 ⊢ ((A ∩ B) = ∅ → (∃r r:x–1-1-onto→(A ∪ B) → x ∈ ( Nc A +c Nc B)))
58	2, 57	syl5bi 208	. . . 4 ⊢ ((A ∩ B) = ∅ → (x ≈ (A ∪ B) → x ∈ ( Nc A +c Nc B)))
59		eladdc 4398	. . . . 5 ⊢ (x ∈ ( Nc A +c Nc B) ↔ ∃p ∈ Nc A∃q ∈ Nc B((p ∩ q) = ∅ ∧ x = (p ∪ q)))
60		simplrl 736	. . . . . . . . . 10 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → p ∈ Nc A)
61		elnc 6125	. . . . . . . . . 10 ⊢ (p ∈ Nc A ↔ p ≈ A)
62	60, 61	sylib 188	. . . . . . . . 9 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → p ≈ A)
63		simplrr 737	. . . . . . . . . 10 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → q ∈ Nc B)
64		elnc 6125	. . . . . . . . . 10 ⊢ (q ∈ Nc B ↔ q ≈ B)
65	63, 64	sylib 188	. . . . . . . . 9 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → q ≈ B)
66		simpr 447	. . . . . . . . 9 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → (p ∩ q) = ∅)
67		simpll 730	. . . . . . . . 9 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → (A ∩ B) = ∅)
68		unen 6048	. . . . . . . . 9 ⊢ (((p ≈ A ∧ q ≈ B) ∧ ((p ∩ q) = ∅ ∧ (A ∩ B) = ∅)) → (p ∪ q) ≈ (A ∪ B))
69	62, 65, 66, 67, 68	syl22anc 1183	. . . . . . . 8 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → (p ∪ q) ≈ (A ∪ B))
70		breq1 4642	. . . . . . . 8 ⊢ (x = (p ∪ q) → (x ≈ (A ∪ B) ↔ (p ∪ q) ≈ (A ∪ B)))
71	69, 70	syl5ibrcom 213	. . . . . . 7 ⊢ ((((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) ∧ (p ∩ q) = ∅) → (x = (p ∪ q) → x ≈ (A ∪ B)))
72	71	expimpd 586	. . . . . 6 ⊢ (((A ∩ B) = ∅ ∧ (p ∈ Nc A ∧ q ∈ Nc B)) → (((p ∩ q) = ∅ ∧ x = (p ∪ q)) → x ≈ (A ∪ B)))
73	72	rexlimdvva 2745	. . . . 5 ⊢ ((A ∩ B) = ∅ → (∃p ∈ Nc A∃q ∈ Nc B((p ∩ q) = ∅ ∧ x = (p ∪ q)) → x ≈ (A ∪ B)))
74	59, 73	syl5bi 208	. . . 4 ⊢ ((A ∩ B) = ∅ → (x ∈ ( Nc A +c Nc B) → x ≈ (A ∪ B)))
75	58, 74	impbid 183	. . 3 ⊢ ((A ∩ B) = ∅ → (x ≈ (A ∪ B) ↔ x ∈ ( Nc A +c Nc B)))
76	1, 75	syl5bb 248	. 2 ⊢ ((A ∩ B) = ∅ → (x ∈ Nc (A ∪ B) ↔ x ∈ ( Nc A +c Nc B)))
77	76	eqrdv 2351	1 ⊢ ((A ∩ B) = ∅ → Nc (A ∪ B) = ( Nc A +c Nc B))

Syntax hints:   → wi 4   ∧ wa 358  ∃wex 1541   = wceq 1642   ∈ wcel 1710  ∃wrex 2615  Vcvv 2859   ∪ cun 3207   ∩ cin 3208   ⊆ wss 3257  ∅c0 3550   +_c cplc 4375   class class class wbr 4639   “ cima 4722  ^◡ccnv 4771  dom cdm 4772  ran crn 4773   ↾ cres 4774  Fun wfun 4775  –→wf 4777  –1-1→wf1 4778  –onto→wfo 4779  –1-1-onto→wf1o 4780   ≈ cen 6028   Nc cnc 6091

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-13 1712  ax-14 1714  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-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-rex 2620  df-reu 2621  df-rmo 2622  df-rab 2623  df-v 2861  df-sbc 3047  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215  df-symdif 3216  df-ss 3259  df-pss 3261  df-nul 3551  df-if 3663  df-pw 3724  df-sn 3741  df-pr 3742  df-uni 3892  df-int 3927  df-opk 4058  df-1c 4136  df-pw1 4137  df-uni1 4138  df-xpk 4185  df-cnvk 4186  df-ins2k 4187  df-ins3k 4188  df-imak 4189  df-cok 4190  df-p6 4191  df-sik 4192  df-ssetk 4193  df-imagek 4194  df-idk 4195  df-iota 4339  df-0c 4377  df-addc 4378  df-nnc 4379  df-fin 4380  df-lefin 4440  df-ltfin 4441  df-ncfin 4442  df-tfin 4443  df-evenfin 4444  df-oddfin 4445  df-sfin 4446  df-spfin 4447  df-phi 4565  df-op 4566  df-proj1 4567  df-proj2 4568  df-opab 4623  df-br 4640  df-1st 4723  df-swap 4724  df-sset 4725  df-co 4726  df-ima 4727  df-si 4728  df-id 4767  df-xp 4784  df-cnv 4785  df-rn 4786  df-dm 4787  df-res 4788  df-fun 4789  df-fn 4790  df-f 4791  df-f1 4792  df-fo 4793  df-f1o 4794  df-2nd 4797  df-txp 5736  df-ins2 5750  df-ins3 5752  df-image 5754  df-ins4 5756  df-si3 5758  df-funs 5760  df-fns 5762  df-trans 5899  df-sym 5908  df-er 5909  df-ec 5947  df-en 6029  df-nc 6101

This theorem is referenced by:  ncaddccl  6144  1p1e2c  6155  2p1e3c  6156  dflec2  6210  addcdi  6250  nchoicelem7  6295  nchoicelem14  6302