Theorem carduni 9978

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 7769	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ⊆ On → ∪ 𝐴 ∈ On))
2		fveq2 6891	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (card‘𝑥) = (card‘𝑦))
3		id 22	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
4	2, 3	eqeq12d 2748	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → ((card‘𝑥) = 𝑥 ↔ (card‘𝑦) = 𝑦))
5	4	rspcv 3608	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘𝑦) = 𝑦))
6		cardon 9941	. . . . . . . 8 ⊢ (card‘𝑦) ∈ On
7		eleq1 2821	. . . . . . . 8 ⊢ ((card‘𝑦) = 𝑦 → ((card‘𝑦) ∈ On ↔ 𝑦 ∈ On))
8	6, 7	mpbii 232	. . . . . . 7 ⊢ ((card‘𝑦) = 𝑦 → 𝑦 ∈ On)
9	5, 8	syl6com 37	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (𝑦 ∈ 𝐴 → 𝑦 ∈ On))
10	9	ssrdv 3988	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → 𝐴 ⊆ On)
11	1, 10	impel 506	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ∪ 𝐴 ∈ On)
12		cardonle 9954	. . . 4 ⊢ (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ⊆ ∪ 𝐴)
13	11, 12	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → (card‘∪ 𝐴) ⊆ ∪ 𝐴)
14		cardon 9941	. . . . 5 ⊢ (card‘∪ 𝐴) ∈ On
15	14	onirri 6477	. . . 4 ⊢ ¬ (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)
16		eluni 4911	. . . . . . . 8 ⊢ ((card‘∪ 𝐴) ∈ ∪ 𝐴 ↔ ∃𝑦((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴))
17		elssuni 4941	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ⊆ ∪ 𝐴)
18		ssdomg 8998	. . . . . . . . . . . . . . . . . . 19 ⊢ (∪ 𝐴 ∈ On → (𝑦 ⊆ ∪ 𝐴 → 𝑦 ≼ ∪ 𝐴))
19	18	adantl 482	. . . . . . . . . . . . . . . . . 18 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ⊆ ∪ 𝐴 → 𝑦 ≼ ∪ 𝐴))
20	17, 19	syl5 34	. . . . . . . . . . . . . . . . 17 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → 𝑦 ≼ ∪ 𝐴))
21		id 22	. . . . . . . . . . . . . . . . . . 19 ⊢ ((card‘𝑦) = 𝑦 → (card‘𝑦) = 𝑦)
22		onenon 9946	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((card‘𝑦) ∈ On → (card‘𝑦) ∈ dom card)
23	6, 22	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (card‘𝑦) ∈ dom card
24	21, 23	eqeltrrdi 2842	. . . . . . . . . . . . . . . . . 18 ⊢ ((card‘𝑦) = 𝑦 → 𝑦 ∈ dom card)
25		onenon 9946	. . . . . . . . . . . . . . . . . 18 ⊢ (∪ 𝐴 ∈ On → ∪ 𝐴 ∈ dom card)
26		carddom2 9974	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑦 ∈ dom card ∧ ∪ 𝐴 ∈ dom card) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ≼ ∪ 𝐴))
27	24, 25, 26	syl2an 596	. . . . . . . . . . . . . . . . 17 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ≼ ∪ 𝐴))
28	20, 27	sylibrd 258	. . . . . . . . . . . . . . . 16 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → (card‘𝑦) ⊆ (card‘∪ 𝐴)))
29		sseq1 4007	. . . . . . . . . . . . . . . . 17 ⊢ ((card‘𝑦) = 𝑦 → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ⊆ (card‘∪ 𝐴)))
30	29	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → ((card‘𝑦) ⊆ (card‘∪ 𝐴) ↔ 𝑦 ⊆ (card‘∪ 𝐴)))
31	28, 30	sylibd 238	. . . . . . . . . . . . . . 15 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → 𝑦 ⊆ (card‘∪ 𝐴)))
32		ssel 3975	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ⊆ (card‘∪ 𝐴) → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
33	31, 32	syl6 35	. . . . . . . . . . . . . 14 ⊢ (((card‘𝑦) = 𝑦 ∧ ∪ 𝐴 ∈ On) → (𝑦 ∈ 𝐴 → ((card‘∪ 𝐴) ∈ 𝑦 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
34	33	ex 413	. . . . . . . . . . . . 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 407	. . . . . . . . 9 ⊢ (((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
39	38	exlimiv 1933	. . . . . . . 8 ⊢ (∃𝑦((card‘∪ 𝐴) ∈ 𝑦 ∧ 𝑦 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
40	16, 39	sylbi 216	. . . . . . 7 ⊢ ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (∪ 𝐴 ∈ On → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
41	40	com13 88	. . . . . 6 ⊢ (∪ 𝐴 ∈ On → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴))))
42	41	imp 407	. . . . 5 ⊢ ((∪ 𝐴 ∈ On ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
43	11, 42	sylancom 588	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) ∈ ∪ 𝐴 → (card‘∪ 𝐴) ∈ (card‘∪ 𝐴)))
44	15, 43	mtoi 198	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)
45	14	onordi 6475	. . . 4 ⊢ Ord (card‘∪ 𝐴)
46		eloni 6374	. . . . 5 ⊢ (∪ 𝐴 ∈ On → Ord ∪ 𝐴)
47	11, 46	syl 17	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → Ord ∪ 𝐴)
48		ordtri4 6401	. . . 4 ⊢ ((Ord (card‘∪ 𝐴) ∧ Ord ∪ 𝐴) → ((card‘∪ 𝐴) = ∪ 𝐴 ↔ ((card‘∪ 𝐴) ⊆ ∪ 𝐴 ∧ ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)))
49	45, 47, 48	sylancr 587	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → ((card‘∪ 𝐴) = ∪ 𝐴 ↔ ((card‘∪ 𝐴) ⊆ ∪ 𝐴 ∧ ¬ (card‘∪ 𝐴) ∈ ∪ 𝐴)))
50	13, 44, 49	mpbir2and 711	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥) → (card‘∪ 𝐴) = ∪ 𝐴)
51	50	ex 413	1 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ 𝐴 (card‘𝑥) = 𝑥 → (card‘∪ 𝐴) = ∪ 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541  ∃wex 1781   ∈ wcel 2106  ∀wral 3061   ⊆ wss 3948  ∪ cuni 4908   class class class wbr 5148  dom cdm 5676  Ord word 6363  Oncon0 6364  ‘cfv 6543   ≼ cdom 8939  cardccrd 9932

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-ord 6367  df-on 6368  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-card 9936

This theorem is referenced by:  cardiun  9979  carduniima  10093