Theorem cnfcom2 9167

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 7191	. . . . . . . . . 10 ⊢ (𝐹 supp ∅) ∈ V
11	5	oion 9002	. . . . . . . . . 10 ⊢ ((𝐹 supp ∅) ∈ V → dom 𝐺 ∈ On)
12	10, 11	ax-mp 5	. . . . . . . . 9 ⊢ dom 𝐺 ∈ On
13	12	elexi 3515	. . . . . . . 8 ⊢ dom 𝐺 ∈ V
14	13	uniex 7469	. . . . . . 7 ⊢ ∪ dom 𝐺 ∈ V
15	14	sucid 6272	. . . . . 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 9166	. . . . . 6 ⊢ (𝜑 → dom 𝐺 = suc ∪ dom 𝐺)
19	15, 18	eleqtrrid 2922	. . . . 5 ⊢ (𝜑 → ∪ dom 𝐺 ∈ dom 𝐺)
20	1, 2, 3, 4, 5, 6, 7, 8, 9, 19	cnfcom 9165	. . . 4 ⊢ (𝜑 → (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺))))
21	16	oveq2i 7169	. . . . . 6 ⊢ (ω ↑o 𝑊) = (ω ↑o (𝐺‘∪ dom 𝐺))
22	16	fveq2i 6675	. . . . . 6 ⊢ (𝐹‘𝑊) = (𝐹‘(𝐺‘∪ dom 𝐺))
23	21, 22	oveq12i 7170	. . . . 5 ⊢ ((ω ↑o 𝑊) ·o (𝐹‘𝑊)) = ((ω ↑o (𝐺‘∪ dom 𝐺)) ·o (𝐹‘(𝐺‘∪ dom 𝐺)))
24		f1oeq3 6608	. . . . 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 236	. . 3 ⊢ (𝜑 → (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))
27	18	fveq2d 6676	. . . 4 ⊢ (𝜑 → (𝑇‘dom 𝐺) = (𝑇‘suc ∪ dom 𝐺))
28		f1oeq1 6606	. . . 4 ⊢ ((𝑇‘dom 𝐺) = (𝑇‘suc ∪ dom 𝐺) → ((𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊))))
29	27, 28	syl 17	. . 3 ⊢ (𝜑 → ((𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘suc ∪ dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊))))
30	26, 29	mpbird 259	. 2 ⊢ (𝜑 → (𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))
31	4	fveq2i 6675	. . . . 5 ⊢ ((ω CNF 𝐴)‘𝐹) = ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵))
32		omelon 9111	. . . . . . 7 ⊢ ω ∈ On
33	32	a1i 11	. . . . . 6 ⊢ (𝜑 → ω ∈ On)
34	1, 33, 2	cantnff1o 9161	. . . . . . . . 9 ⊢ (𝜑 → (ω CNF 𝐴):𝑆–1-1-onto→(ω ↑o 𝐴))
35		f1ocnv 6629	. . . . . . . . 9 ⊢ ((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑o 𝐴) → ◡(ω CNF 𝐴):(ω ↑o 𝐴)–1-1-onto→𝑆)
36		f1of 6617	. . . . . . . . 9 ⊢ (◡(ω CNF 𝐴):(ω ↑o 𝐴)–1-1-onto→𝑆 → ◡(ω CNF 𝐴):(ω ↑o 𝐴)⟶𝑆)
37	34, 35, 36	3syl 18	. . . . . . . 8 ⊢ (𝜑 → ◡(ω CNF 𝐴):(ω ↑o 𝐴)⟶𝑆)
38	37, 3	ffvelrnd 6854	. . . . . . 7 ⊢ (𝜑 → (◡(ω CNF 𝐴)‘𝐵) ∈ 𝑆)
39	4, 38	eqeltrid 2919	. . . . . 6 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
40	8	oveq1i 7168	. . . . . . . . . 10 ⊢ (𝑀 +o 𝑧) = (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)
41	40	a1i 11	. . . . . . . . 9 ⊢ ((𝑘 ∈ V ∧ 𝑧 ∈ V) → (𝑀 +o 𝑧) = (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧))
42	41	mpoeq3ia 7234	. . . . . . . 8 ⊢ (𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)) = (𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧))
43		eqid 2823	. . . . . . . 8 ⊢ ∅ = ∅
44		seqomeq12 8092	. . . . . . . 8 ⊢ (((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)) = (𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)) ∧ ∅ = ∅) → seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)), ∅))
45	42, 43, 44	mp2an 690	. . . . . . 7 ⊢ seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (𝑀 +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)), ∅)
46	6, 45	eqtri 2846	. . . . . 6 ⊢ 𝐻 = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((ω ↑o (𝐺‘𝑘)) ·o (𝐹‘(𝐺‘𝑘))) +o 𝑧)), ∅)
47	1, 33, 2, 5, 39, 46	cantnfval 9133	. . . . 5 ⊢ (𝜑 → ((ω CNF 𝐴)‘𝐹) = (𝐻‘dom 𝐺))
48	31, 47	syl5reqr 2873	. . . 4 ⊢ (𝜑 → (𝐻‘dom 𝐺) = ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵)))
49	18	fveq2d 6676	. . . 4 ⊢ (𝜑 → (𝐻‘dom 𝐺) = (𝐻‘suc ∪ dom 𝐺))
50		f1ocnvfv2 7036	. . . . 5 ⊢ (((ω CNF 𝐴):𝑆–1-1-onto→(ω ↑o 𝐴) ∧ 𝐵 ∈ (ω ↑o 𝐴)) → ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
51	34, 3, 50	syl2anc 586	. . . 4 ⊢ (𝜑 → ((ω CNF 𝐴)‘(◡(ω CNF 𝐴)‘𝐵)) = 𝐵)
52	48, 49, 51	3eqtr3d 2866	. . 3 ⊢ (𝜑 → (𝐻‘suc ∪ dom 𝐺) = 𝐵)
53	52	f1oeq2d 6613	. 2 ⊢ (𝜑 → ((𝑇‘dom 𝐺):(𝐻‘suc ∪ dom 𝐺)–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)) ↔ (𝑇‘dom 𝐺):𝐵–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊))))
54	30, 53	mpbid 234	1 ⊢ (𝜑 → (𝑇‘dom 𝐺):𝐵–1-1-onto→((ω ↑o 𝑊) ·o (𝐹‘𝑊)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114  Vcvv 3496   ∪ cun 3936  ∅c0 4293  ∪ cuni 4840   ↦ cmpt 5148   E cep 5466  ^◡ccnv 5556  dom cdm 5557  Oncon0 6193  suc csuc 6195  ⟶wf 6353  –1-1-onto→wf1o 6356  ‘cfv 6357  (class class class)co 7158   ∈ cmpo 7160  ωcom 7582   supp csupp 7832  seq_ωcseqom 8085   +_o coa 8101   ·_o comu 8102   ↑_o coe 8103  OrdIsocoi 8975   CNF ccnf 9126

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-inf2 9106

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-supp 7833  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-seqom 8086  df-1o 8104  df-2o 8105  df-oadd 8108  df-omul 8109  df-oexp 8110  df-er 8291  df-map 8410  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-fsupp 8836  df-oi 8976  df-cnf 9127

This theorem is referenced by:  cnfcom3  9169