Theorem cnfcom2 9696

Description: Any nonzero ordinal 𝐵 is equinumerous to the leading term of its Cantor normal form. (Contributed by Mario Carneiro, 30-May-2015.) (Revised by AV, 3-Jul-2019.)

Hypotheses

Ref	Expression
cnfcom.s	⊢ 𝑆 = dom (ω CNF 𝐴)
cnfcom.a	⊢ (𝜑 → 𝐴 ∈ On)
cnfcom.b	⊢ (𝜑 → 𝐵 ∈ (ω ↑o 𝐴))
cnfcom.f	⊢ 𝐹 = (◡(ω CNF 𝐴)‘𝐵)
cnfcom.g	⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
cnfcom.h	⊢ 𝐻 = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)), ∅)
cnfcom.t	⊢ 𝑇 = seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ 𝐾), ∅)
cnfcom.m	⊢ 𝑀 = ((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘)))
cnfcom.k	⊢ 𝐾 = ((𝑥 ∈ 𝑀 ↦ (dom 𝑓 +o 𝑥)) ∪ ◡(𝑥 ∈ dom 𝑓 ↦ (𝑀 +o 𝑥)))
cnfcom.w	⊢ 𝑊 = (𝐺‘∪ dom 𝐺)
cnfcom2.1	⊢ (𝜑 → ∅ ∈ 𝐵)

Assertion

Ref	Expression
cnfcom2	⊢ (𝜑 → (𝑇‘dom 𝐺):𝐵–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))

Distinct variable groups:   𝑥,𝑘,𝑧,𝐴   𝑥,𝑀   𝑓,𝑘,𝑥,𝑧,𝐹   𝑧,𝑇   𝑥,𝑊   𝑓,𝐺,𝑘,𝑥,𝑧   𝑓,𝐻,𝑥   𝑆,𝑘,𝑧   𝜑,𝑘,𝑥,𝑧

Allowed substitution hints:   𝜑(𝑓)   𝐴(𝑓)   𝐵(𝑥, 𝑧, 𝑓, 𝑘)   𝑆(𝑥, 𝑓)   𝑇(𝑥, 𝑓, 𝑘)   𝐻(𝑧, 𝑘)   𝐾(𝑥, 𝑧, 𝑓, 𝑘)   𝑀(𝑧, 𝑓, 𝑘)   𝑊(𝑧, 𝑓, 𝑘)

Proof of Theorem cnfcom2

Step	Hyp	Ref	Expression
1		cnfcom.s	. . . . 5 ⊢ 𝑆 = dom (ω CNF 𝐴)
2		cnfcom.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ On)
3		cnfcom.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ (ω ↑o 𝐴))
4		cnfcom.f	. . . . 5 ⊢ 𝐹 = (◡(ω CNF 𝐴)‘𝐵)
5		cnfcom.g	. . . . 5 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
6		cnfcom.h	. . . . 5 ⊢ 𝐻 = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)), ∅)
7		cnfcom.t	. . . . 5 ⊢ 𝑇 = seqω((𝑘 ∈ V, 𝑓 ∈ V ↦ 𝐾), ∅)
8		cnfcom.m	. . . . 5 ⊢ 𝑀 = ((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘)))
9		cnfcom.k	. . . . 5 ⊢ 𝐾 = ((𝑥 ∈ 𝑀 ↦ (dom 𝑓 +o 𝑥)) ∪ ◡(𝑥 ∈ dom 𝑓 ↦ (𝑀 +o 𝑥)))
10		ovex 7451	. . . . . . . . . 10 ⊢ (𝐹 supp ∅) ∈ V
11	5	oion 9523	. . . . . . . . . 10 ⊢ ((𝐹 supp ∅) ∈ V → dom 𝐺 ∈ On)
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ dom 𝐺 ∈ On
13	12	elexi 3473	. . . . . . . 8 ⊢ dom 𝐺 ∈ V
14	13	uniex 7756	. . . . . . 7 ⊢ ∪ dom 𝐺 ∈ V
15	14	sucid 6446	. . . . . 6 ⊢ ∪ dom 𝐺 ∈ suc ∪ dom 𝐺
16		cnfcom.w	. . . . . . 7 ⊢ 𝑊 = (𝐺‘∪ dom 𝐺)
17		cnfcom2.1	. . . . . . 7 ⊢ (𝜑 → ∅ ∈ 𝐵)
18	1, 2, 3, 4, 5, 6, 7, 8, 9, 16, 17	cnfcom2lem 9695	. . . . . 6 ⊢ (𝜑 → dom 𝐺 = suc ∪ dom 𝐺)
19	15, 18	eleqtrrid 2868	. . . . 5 ⊢ (𝜑 → ∪ dom 𝐺 ∈ dom 𝐺)
20	1, 2, 3, 4, 5, 6, 7, 8, 9, 19	cnfcom 9694	. . . 4 ⊢ (𝜑 → (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺))))
21	16	oveq2i 7429	. . . . . 6 ⊢ (ω ↑o 𝑊) = (ω ↑o (𝐺‘∪ dom 𝐺))
22	16	fveq2i 6886	. . . . . 6 ⊢ (𝐹‘𝑊) = (𝐹‘(𝐺‘∪ dom 𝐺))
23	21, 22	oveq12i 7430	. . . . 5 ⊢ ((ω ↑o 𝑊) ·o (𝐹‘𝑊)) = ((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺)))
24		f1oeq3 6812	. . . . 5 ⊢ (((ω ↑o 𝑊) ·o (𝐹‘𝑊)) = ((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺))) → ((𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺)))))
25	23, 24	ax-mp 5	. . . 4 ⊢ ((𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺))))
26	20, 25	sylibr 237	. . 3 ⊢ (𝜑 → (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))
27	18	fveq2d 6887	. . . 4 ⊢ (𝜑 → (𝑇‘dom 𝐺) = (𝑇‘suc ∪ dom 𝐺))
28	27	f1oeq1d 6817	. . 3 ⊢ (𝜑 → ((𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊))))
29	26, 28	mpbird 260	. 2 ⊢ (𝜑 → (𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))
30		omelon 9640	. . . . . . 7 ⊢ ω ∈ On
31	30	a1i 11	. . . . . 6 ⊢ (𝜑 → ω ∈ On)
32	1, 31, 2	cantnff1o 9690	. . . . . . . . 9 ⊢ (𝜑 → (ω CNF 𝐴):𝑆–1-1-onto→(ω ↑o 𝐴))
33		f1ocnv 6835	. . . . . . . . 9 ⊢ ((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑o 𝐴) → ◡(ω CNF 𝐴):(ω ↑o 𝐴)–1-1-onto→𝑆)
34		f1of 6822	. . . . . . . . 9 ⊢ (◡(ω CNF 𝐴):(ω ↑o 𝐴)–1-1-onto→𝑆 → ◡(ω CNF 𝐴):(ω ↑o 𝐴)⟶𝑆)
35	32, 33, 34	3syl 19	. . . . . . . 8 ⊢ (𝜑 → ◡(ω CNF 𝐴):(ω ↑o 𝐴)⟶𝑆)
36	35, 3	ffvelcdmd 7083	. . . . . . 7 ⊢ (𝜑 → (◡(ω CNF 𝐴)‘𝐵) ∈ 𝑆)
37	4, 36	eqeltrid 2865	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
38	8	oveq1i 7428	. . . . . . . . . 10 ⊢ (𝑀 +o 𝑧) = (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)
39	38	a1i 11	. . . . . . . . 9 ⊢ ((𝑘 ∈ V ∧ 𝑧 ∈ V) → (𝑀 +o 𝑧) = (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧))
40	39	mpoeq3ia 7496	. . . . . . . 8 ⊢ (𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)) = (𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧))
41		eqid 2761	. . . . . . . 8 ⊢ ∅ = ∅
42		seqomeq12 8457	. . . . . . . 8 ⊢ (((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)) = (𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)) ∧ ∅ = ∅) → seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)), ∅))
43	40, 41, 42	mp2an 705	. . . . . . 7 ⊢ seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)), ∅)
44	6, 43	eqtri 2784	. . . . . 6 ⊢ 𝐻 = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)), ∅)
45	1, 31, 2, 5, 37, 44	cantnfval 9662	. . . . 5 ⊢ (𝜑 → ((ω CNF 𝐴)‘𝐹) = (𝐻‘dom 𝐺))
46	4	fveq2i 6886	. . . . 5 ⊢ ((ω CNF 𝐴)‘𝐹) = ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵))
47	45, 46	eqtr3di 2811	. . . 4 ⊢ (𝜑 → (𝐻‘dom 𝐺) = ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵)))
48	18	fveq2d 6887	. . . 4 ⊢ (𝜑 → (𝐻‘dom 𝐺) = (𝐻‘suc ∪ dom 𝐺))
49		f1ocnvfv2 7283	. . . . 5 ⊢ (((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑o 𝐴) ∧ 𝐵 ∈ (ω ↑o 𝐴)) → ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
50	32, 3, 49	syl2anc 596	. . . 4 ⊢ (𝜑 → ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
51	47, 48, 50	3eqtr3d 2804	. . 3 ⊢ (𝜑 → (𝐻‘suc ∪ dom 𝐺) = 𝐵)
52	51	f1oeq2d 6818	. 2 ⊢ (𝜑 → ((𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘dom 𝐺):𝐵–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊))))
53	29, 52	mpbid 235	1 ⊢ (𝜑 → (𝑇‘dom 𝐺):𝐵–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897  ∅c0 4279  ∪ cuni 4867   ↦ cmpt 5186   E cep 5550  ^◡ccnv 5650  dom cdm 5651  Oncon0 6361  suc csuc 6363  ⟶wf 6533  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  ωcom 7875   supp csupp 8170  seq_ωcseqom 8450   +_o coa 8466   ·_o comu 8467   ↑_o coe 8468  OrdIsocoi 9496   CNF ccnf 9655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749  ax-inf2 9635

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-isom 6546  df-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-supp 8171  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-seqom 8451  df-1o 8469  df-2o 8470  df-oadd 8473  df-omul 8474  df-oexp 8475  df-er 8710  df-map 8842  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-fsupp 9347  df-oi 9497  df-cnf 9656

This theorem is used by:  cnfcom3  9698