Theorem carduni 10000

Description: The union of a set of cardinals is a cardinal. Theorem 18.14 of [Monk1] p. 133. (Contributed by Mario Carneiro, 20-Jan-2013.)

Assertion

Ref	Expression
carduni	⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘∪ 𝐴) = ∪ 𝐴))

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem carduni

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssonuni 7779	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ⊆ On → ∪ 𝐴 ∈ On))
2		fveq2 6881	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
3		id 22	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
4	2, 3	eqeq12d 2752	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
5	4	rspcv 3602	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘𝑦) = 𝑦))
6		cardon 9963	. . . . . . . 8 ⊢ (card‘𝑦) ∈ On
7		eleq1 2823	. . . . . . . 8 ⊢ ((card‘𝑦) = 𝑦 → ((card‘𝑦) ∈ On ↔ 𝑦 ∈ On))
8	6, 7	mpbii 233	. . . . . . 7 ⊢ ((card‘𝑦) = 𝑦 → 𝑦 ∈ On)
9	5, 8	syl6com 37	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (𝑦 ∈ 𝐴 → 𝑦 ∈ On))
10	9	ssrdv 3969	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → 𝐴 ⊆ On)
11	1, 10	impel 505	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ∪ 𝐴 ∈ On)
12		cardonle 9976	. . . 4 ⊢ (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ⊆ ∪ 𝐴)
13	11, 12	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → (card‘∪ 𝐴) ⊆ ∪ 𝐴)
14		cardon 9963	. . . . 5 ⊢ (card‘∪ 𝐴) ∈ On
15	14	onirri 6472	. . . 4 ⊢ ¬ (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)
16		eluni 4891	. . . . . . . 8 ⊢ ((card‘∪ 𝐴) ∈ ∪ 𝐴 ↔ ∃𝑦((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴))
17		elssuni 4918	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ⊆ ∪ 𝐴)
18		ssdomg 9019	. . . . . . . . . . . . . . . . . . 19 ⊢ (∪ 𝐴 ∈ On → (𝑦 ⊆ ∪ 𝐴 → 𝑦 ≼ ∪ 𝐴))
19	18	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ⊆ ∪ 𝐴 → 𝑦 ≼ ∪ 𝐴))
20	17, 19	syl5 34	. . . . . . . . . . . . . . . . 17 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → 𝑦 ≼ ∪ 𝐴))
21		id 22	. . . . . . . . . . . . . . . . . . 19 ⊢ ((card‘𝑦) = 𝑦 → (card‘𝑦) = 𝑦)
22		onenon 9968	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((card‘𝑦) ∈ On → (card‘𝑦) ∈ dom card)
23	6, 22	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (card‘𝑦) ∈ dom card
24	21, 23	eqeltrrdi 2844	. . . . . . . . . . . . . . . . . 18 ⊢ ((card‘𝑦) = 𝑦 → 𝑦 ∈ dom card)
25		onenon 9968	. . . . . . . . . . . . . . . . . 18 ⊢ (∪ 𝐴 ∈ On → ∪ 𝐴 ∈ dom card)
26		carddom2 9996	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ dom card ∧ ∪ 𝐴 ∈ dom card) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ≼ ∪ 𝐴))
27	24, 25, 26	syl2an 596	. . . . . . . . . . . . . . . . 17 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ≼ ∪ 𝐴))
28	20, 27	sylibrd 259	. . . . . . . . . . . . . . . 16 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → (card‘𝑦) ⊆ (card‘∪ 𝐴)))
29		sseq1 3989	. . . . . . . . . . . . . . . . 17 ⊢ ((card‘𝑦) = 𝑦 → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ⊆ (card‘∪ 𝐴)))
30	29	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ⊆ (card‘∪ 𝐴)))
31	28, 30	sylibd 239	. . . . . . . . . . . . . . 15 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → 𝑦 ⊆ (card‘∪ 𝐴)))
32		ssel 3957	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ⊆ (card‘∪ 𝐴) → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
33	31, 32	syl6 35	. . . . . . . . . . . . . 14 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
34	33	ex 412	. . . . . . . . . . . . 13 ⊢ ((card‘𝑦) = 𝑦 → (∪ 𝐴 ∈ On → (𝑦 ∈ 𝐴 → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
35	34	com3r 87	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ 𝐴 → ((card‘𝑦) = 𝑦 → (∪ 𝐴 ∈ On → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
36	5, 35	syld 47	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
37	36	com4r 94	. . . . . . . . . 10 ⊢ ((card‘∪ 𝐴) ∈ 𝑦 → (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))))
38	37	imp 406	. . . . . . . . 9 ⊢ (((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
39	38	exlimiv 1930	. . . . . . . 8 ⊢ (∃𝑦((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
40	16, 39	sylbi 217	. . . . . . 7 ⊢ ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
41	40	com13 88	. . . . . 6 ⊢ (∪ 𝐴 ∈ On → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
42	41	imp 406	. . . . 5 ⊢ ((∪ 𝐴 ∈ On ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
43	11, 42	sylancom 588	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
44	15, 43	mtoi 199	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)
45	14	onordi 6470	. . . 4 ⊢ Ord (card‘∪ 𝐴)
46		eloni 6367	. . . . 5 ⊢ (∪ 𝐴 ∈ On → Ord ∪ 𝐴)
47	11, 46	syl 17	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → Ord ∪ 𝐴)
48		ordtri4 6394	. . . 4 ⊢ ((Ord (card‘∪ 𝐴) ∧ Ord ∪ 𝐴) → ((card‘∪ 𝐴) = ∪ 𝐴 ↔ ((card‘∪ 𝐴) ⊆ ∪ 𝐴 ∧ ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)))
49	45, 47, 48	sylancr 587	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) = ∪ 𝐴 ↔ ((card‘∪ 𝐴) ⊆ ∪ 𝐴 ∧ ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)))
50	13, 44, 49	mpbir2and 713	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → (card‘∪ 𝐴) = ∪ 𝐴)
51	50	ex 412	1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘∪ 𝐴) = ∪ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∀wral 3052   ⊆ wss 3931  ∪ cuni 4888   class class class wbr 5124  dom cdm 5659  Ord word 6356  Oncon0 6357  ‘cfv 6536   ≼ cdom 8962  cardccrd 9954

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-rab 3421  df-v 3466  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-er 8724  df-en 8965  df-dom 8966  df-sdom 8967  df-card 9958

This theorem is referenced by:  cardiun  10001  carduniima  10115