MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cantnflem1d Structured version   Visualization version   GIF version

Theorem cantnflem1d 9624
Description: Lemma for cantnf 9629. (Contributed by Mario Carneiro, 4-Jun-2015.) (Revised by AV, 2-Jul-2019.)
Hypotheses
Ref Expression
cantnfs.s 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a (𝜑𝐴 ∈ On)
cantnfs.b (𝜑𝐵 ∈ On)
oemapval.t 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
oemapval.f (𝜑𝐹𝑆)
oemapval.g (𝜑𝐺𝑆)
oemapvali.r (𝜑𝐹𝑇𝐺)
oemapvali.x 𝑋 = {𝑐𝐵 ∣ (𝐹𝑐) ∈ (𝐺𝑐)}
cantnflem1.o 𝑂 = OrdIso( E , (𝐺 supp ∅))
cantnflem1.h 𝐻 = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑂𝑘)) ·o (𝐺‘(𝑂𝑘))) +o 𝑧)), ∅)
Assertion
Ref Expression
cantnflem1d (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if(𝑥𝑋, (𝐹𝑥), ∅))) ∈ (𝐻‘suc (𝑂𝑋)))
Distinct variable groups:   𝑘,𝑐,𝑤,𝑥,𝑦,𝑧,𝐵   𝐴,𝑐,𝑘,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐,𝑘   𝑘,𝐹,𝑤,𝑥,𝑦,𝑧   𝑆,𝑐,𝑘,𝑥,𝑦,𝑧   𝐺,𝑐,𝑘,𝑤,𝑥,𝑦,𝑧   𝑥,𝐻,𝑦   𝑘,𝑂,𝑤,𝑥,𝑦,𝑧   𝜑,𝑘,𝑥,𝑦,𝑧   𝑘,𝑋,𝑤,𝑥,𝑦,𝑧   𝐹,𝑐   𝜑,𝑐
Allowed substitution hints:   𝜑(𝑤)   𝑆(𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)   𝐻(𝑧,𝑤,𝑘,𝑐)   𝑂(𝑐)   𝑋(𝑐)

Proof of Theorem cantnflem1d
StepHypRef Expression
1 cantnfs.a . . . . . 6 (𝜑𝐴 ∈ On)
2 cantnfs.b . . . . . . 7 (𝜑𝐵 ∈ On)
3 cantnfs.s . . . . . . . . 9 𝑆 = dom (𝐴 CNF 𝐵)
4 oemapval.t . . . . . . . . 9 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐵 ((𝑥𝑧) ∈ (𝑦𝑧) ∧ ∀𝑤𝐵 (𝑧𝑤 → (𝑥𝑤) = (𝑦𝑤)))}
5 oemapval.f . . . . . . . . 9 (𝜑𝐹𝑆)
6 oemapval.g . . . . . . . . 9 (𝜑𝐺𝑆)
7 oemapvali.r . . . . . . . . 9 (𝜑𝐹𝑇𝐺)
8 oemapvali.x . . . . . . . . 9 𝑋 = {𝑐𝐵 ∣ (𝐹𝑐) ∈ (𝐺𝑐)}
93, 1, 2, 4, 5, 6, 7, 8oemapvali 9620 . . . . . . . 8 (𝜑 → (𝑋𝐵 ∧ (𝐹𝑋) ∈ (𝐺𝑋) ∧ ∀𝑤𝐵 (𝑋𝑤 → (𝐹𝑤) = (𝐺𝑤))))
109simp1d 1142 . . . . . . 7 (𝜑𝑋𝐵)
11 onelon 6342 . . . . . . 7 ((𝐵 ∈ On ∧ 𝑋𝐵) → 𝑋 ∈ On)
122, 10, 11syl2anc 584 . . . . . 6 (𝜑𝑋 ∈ On)
13 oecl 8483 . . . . . 6 ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴o 𝑋) ∈ On)
141, 12, 13syl2anc 584 . . . . 5 (𝜑 → (𝐴o 𝑋) ∈ On)
153, 1, 2cantnfs 9602 . . . . . . . . 9 (𝜑 → (𝐺𝑆 ↔ (𝐺:𝐵𝐴𝐺 finSupp ∅)))
166, 15mpbid 231 . . . . . . . 8 (𝜑 → (𝐺:𝐵𝐴𝐺 finSupp ∅))
1716simpld 495 . . . . . . 7 (𝜑𝐺:𝐵𝐴)
1817, 10ffvelcdmd 7036 . . . . . 6 (𝜑 → (𝐺𝑋) ∈ 𝐴)
19 onelon 6342 . . . . . 6 ((𝐴 ∈ On ∧ (𝐺𝑋) ∈ 𝐴) → (𝐺𝑋) ∈ On)
201, 18, 19syl2anc 584 . . . . 5 (𝜑 → (𝐺𝑋) ∈ On)
21 omcl 8482 . . . . 5 (((𝐴o 𝑋) ∈ On ∧ (𝐺𝑋) ∈ On) → ((𝐴o 𝑋) ·o (𝐺𝑋)) ∈ On)
2214, 20, 21syl2anc 584 . . . 4 (𝜑 → ((𝐴o 𝑋) ·o (𝐺𝑋)) ∈ On)
23 ovexd 7392 . . . . . . . . . 10 (𝜑 → (𝐺 supp ∅) ∈ V)
24 cantnflem1.o . . . . . . . . . . . 12 𝑂 = OrdIso( E , (𝐺 supp ∅))
253, 1, 2, 24, 6cantnfcl 9603 . . . . . . . . . . 11 (𝜑 → ( E We (𝐺 supp ∅) ∧ dom 𝑂 ∈ ω))
2625simpld 495 . . . . . . . . . 10 (𝜑 → E We (𝐺 supp ∅))
2724oiiso 9473 . . . . . . . . . 10 (((𝐺 supp ∅) ∈ V ∧ E We (𝐺 supp ∅)) → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
2823, 26, 27syl2anc 584 . . . . . . . . 9 (𝜑𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
29 isof1o 7268 . . . . . . . . 9 (𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)) → 𝑂:dom 𝑂1-1-onto→(𝐺 supp ∅))
3028, 29syl 17 . . . . . . . 8 (𝜑𝑂:dom 𝑂1-1-onto→(𝐺 supp ∅))
31 f1ocnv 6796 . . . . . . . 8 (𝑂:dom 𝑂1-1-onto→(𝐺 supp ∅) → 𝑂:(𝐺 supp ∅)–1-1-onto→dom 𝑂)
32 f1of 6784 . . . . . . . 8 (𝑂:(𝐺 supp ∅)–1-1-onto→dom 𝑂𝑂:(𝐺 supp ∅)⟶dom 𝑂)
3330, 31, 323syl 18 . . . . . . 7 (𝜑𝑂:(𝐺 supp ∅)⟶dom 𝑂)
343, 1, 2, 4, 5, 6, 7, 8cantnflem1a 9621 . . . . . . 7 (𝜑𝑋 ∈ (𝐺 supp ∅))
3533, 34ffvelcdmd 7036 . . . . . 6 (𝜑 → (𝑂𝑋) ∈ dom 𝑂)
3625simprd 496 . . . . . 6 (𝜑 → dom 𝑂 ∈ ω)
37 elnn 7813 . . . . . 6 (((𝑂𝑋) ∈ dom 𝑂 ∧ dom 𝑂 ∈ ω) → (𝑂𝑋) ∈ ω)
3835, 36, 37syl2anc 584 . . . . 5 (𝜑 → (𝑂𝑋) ∈ ω)
39 cantnflem1.h . . . . . . 7 𝐻 = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴o (𝑂𝑘)) ·o (𝐺‘(𝑂𝑘))) +o 𝑧)), ∅)
4039cantnfvalf 9601 . . . . . 6 𝐻:ω⟶On
4140ffvelcdmi 7034 . . . . 5 ((𝑂𝑋) ∈ ω → (𝐻‘(𝑂𝑋)) ∈ On)
4238, 41syl 17 . . . 4 (𝜑 → (𝐻‘(𝑂𝑋)) ∈ On)
43 oaword1 8499 . . . 4 ((((𝐴o 𝑋) ·o (𝐺𝑋)) ∈ On ∧ (𝐻‘(𝑂𝑋)) ∈ On) → ((𝐴o 𝑋) ·o (𝐺𝑋)) ⊆ (((𝐴o 𝑋) ·o (𝐺𝑋)) +o (𝐻‘(𝑂𝑋))))
4422, 42, 43syl2anc 584 . . 3 (𝜑 → ((𝐴o 𝑋) ·o (𝐺𝑋)) ⊆ (((𝐴o 𝑋) ·o (𝐺𝑋)) +o (𝐻‘(𝑂𝑋))))
453, 1, 2, 24, 6, 39cantnfsuc 9606 . . . . 5 ((𝜑 ∧ (𝑂𝑋) ∈ ω) → (𝐻‘suc (𝑂𝑋)) = (((𝐴o (𝑂‘(𝑂𝑋))) ·o (𝐺‘(𝑂‘(𝑂𝑋)))) +o (𝐻‘(𝑂𝑋))))
4638, 45mpdan 685 . . . 4 (𝜑 → (𝐻‘suc (𝑂𝑋)) = (((𝐴o (𝑂‘(𝑂𝑋))) ·o (𝐺‘(𝑂‘(𝑂𝑋)))) +o (𝐻‘(𝑂𝑋))))
47 f1ocnvfv2 7223 . . . . . . . 8 ((𝑂:dom 𝑂1-1-onto→(𝐺 supp ∅) ∧ 𝑋 ∈ (𝐺 supp ∅)) → (𝑂‘(𝑂𝑋)) = 𝑋)
4830, 34, 47syl2anc 584 . . . . . . 7 (𝜑 → (𝑂‘(𝑂𝑋)) = 𝑋)
4948oveq2d 7373 . . . . . 6 (𝜑 → (𝐴o (𝑂‘(𝑂𝑋))) = (𝐴o 𝑋))
5048fveq2d 6846 . . . . . 6 (𝜑 → (𝐺‘(𝑂‘(𝑂𝑋))) = (𝐺𝑋))
5149, 50oveq12d 7375 . . . . 5 (𝜑 → ((𝐴o (𝑂‘(𝑂𝑋))) ·o (𝐺‘(𝑂‘(𝑂𝑋)))) = ((𝐴o 𝑋) ·o (𝐺𝑋)))
5251oveq1d 7372 . . . 4 (𝜑 → (((𝐴o (𝑂‘(𝑂𝑋))) ·o (𝐺‘(𝑂‘(𝑂𝑋)))) +o (𝐻‘(𝑂𝑋))) = (((𝐴o 𝑋) ·o (𝐺𝑋)) +o (𝐻‘(𝑂𝑋))))
5346, 52eqtrd 2776 . . 3 (𝜑 → (𝐻‘suc (𝑂𝑋)) = (((𝐴o 𝑋) ·o (𝐺𝑋)) +o (𝐻‘(𝑂𝑋))))
5444, 53sseqtrrd 3985 . 2 (𝜑 → ((𝐴o 𝑋) ·o (𝐺𝑋)) ⊆ (𝐻‘suc (𝑂𝑋)))
55 onss 7719 . . . . . . . . . . 11 (𝐵 ∈ On → 𝐵 ⊆ On)
562, 55syl 17 . . . . . . . . . 10 (𝜑𝐵 ⊆ On)
5756sselda 3944 . . . . . . . . 9 ((𝜑𝑥𝐵) → 𝑥 ∈ On)
5812adantr 481 . . . . . . . . 9 ((𝜑𝑥𝐵) → 𝑋 ∈ On)
59 onsseleq 6358 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑋 ∈ On) → (𝑥𝑋 ↔ (𝑥𝑋𝑥 = 𝑋)))
6057, 58, 59syl2anc 584 . . . . . . . 8 ((𝜑𝑥𝐵) → (𝑥𝑋 ↔ (𝑥𝑋𝑥 = 𝑋)))
61 orcom 868 . . . . . . . 8 ((𝑥𝑋𝑥 = 𝑋) ↔ (𝑥 = 𝑋𝑥𝑋))
6260, 61bitrdi 286 . . . . . . 7 ((𝜑𝑥𝐵) → (𝑥𝑋 ↔ (𝑥 = 𝑋𝑥𝑋)))
6362ifbid 4509 . . . . . 6 ((𝜑𝑥𝐵) → if(𝑥𝑋, (𝐹𝑥), ∅) = if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅))
6463mpteq2dva 5205 . . . . 5 (𝜑 → (𝑥𝐵 ↦ if(𝑥𝑋, (𝐹𝑥), ∅)) = (𝑥𝐵 ↦ if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅)))
6564fveq2d 6846 . . . 4 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if(𝑥𝑋, (𝐹𝑥), ∅))) = ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅))))
663, 1, 2cantnfs 9602 . . . . . . . . . . . 12 (𝜑 → (𝐹𝑆 ↔ (𝐹:𝐵𝐴𝐹 finSupp ∅)))
675, 66mpbid 231 . . . . . . . . . . 11 (𝜑 → (𝐹:𝐵𝐴𝐹 finSupp ∅))
6867simpld 495 . . . . . . . . . 10 (𝜑𝐹:𝐵𝐴)
6968ffvelcdmda 7035 . . . . . . . . 9 ((𝜑𝑦𝐵) → (𝐹𝑦) ∈ 𝐴)
7018ne0d 4295 . . . . . . . . . . 11 (𝜑𝐴 ≠ ∅)
71 on0eln0 6373 . . . . . . . . . . . 12 (𝐴 ∈ On → (∅ ∈ 𝐴𝐴 ≠ ∅))
721, 71syl 17 . . . . . . . . . . 11 (𝜑 → (∅ ∈ 𝐴𝐴 ≠ ∅))
7370, 72mpbird 256 . . . . . . . . . 10 (𝜑 → ∅ ∈ 𝐴)
7473adantr 481 . . . . . . . . 9 ((𝜑𝑦𝐵) → ∅ ∈ 𝐴)
7569, 74ifcld 4532 . . . . . . . 8 ((𝜑𝑦𝐵) → if(𝑦𝑋, (𝐹𝑦), ∅) ∈ 𝐴)
7675fmpttd 7063 . . . . . . 7 (𝜑 → (𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)):𝐵𝐴)
77 0ex 5264 . . . . . . . . 9 ∅ ∈ V
7877a1i 11 . . . . . . . 8 (𝜑 → ∅ ∈ V)
7967simprd 496 . . . . . . . 8 (𝜑𝐹 finSupp ∅)
8068, 2, 78, 79fsuppmptif 9335 . . . . . . 7 (𝜑 → (𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)) finSupp ∅)
813, 1, 2cantnfs 9602 . . . . . . 7 (𝜑 → ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)) ∈ 𝑆 ↔ ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)):𝐵𝐴 ∧ (𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)) finSupp ∅)))
8276, 80, 81mpbir2and 711 . . . . . 6 (𝜑 → (𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)) ∈ 𝑆)
8368, 10ffvelcdmd 7036 . . . . . 6 (𝜑 → (𝐹𝑋) ∈ 𝐴)
84 eldifn 4087 . . . . . . . . 9 (𝑦 ∈ (𝐵𝑋) → ¬ 𝑦𝑋)
8584adantl 482 . . . . . . . 8 ((𝜑𝑦 ∈ (𝐵𝑋)) → ¬ 𝑦𝑋)
8685iffalsed 4497 . . . . . . 7 ((𝜑𝑦 ∈ (𝐵𝑋)) → if(𝑦𝑋, (𝐹𝑦), ∅) = ∅)
8786, 2suppss2 8131 . . . . . 6 (𝜑 → ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)) supp ∅) ⊆ 𝑋)
88 ifor 4540 . . . . . . . 8 if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅) = if(𝑥 = 𝑋, (𝐹𝑥), if(𝑥𝑋, (𝐹𝑥), ∅))
89 fveq2 6842 . . . . . . . . . . 11 (𝑥 = 𝑋 → (𝐹𝑥) = (𝐹𝑋))
9089adantl 482 . . . . . . . . . 10 ((𝑥𝐵𝑥 = 𝑋) → (𝐹𝑥) = (𝐹𝑋))
9190ifeq1da 4517 . . . . . . . . 9 (𝑥𝐵 → if(𝑥 = 𝑋, (𝐹𝑥), ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹𝑋), ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥)))
92 eleq1w 2820 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝑦𝑋𝑥𝑋))
93 fveq2 6842 . . . . . . . . . . . 12 (𝑦 = 𝑥 → (𝐹𝑦) = (𝐹𝑥))
9492, 93ifbieq1d 4510 . . . . . . . . . . 11 (𝑦 = 𝑥 → if(𝑦𝑋, (𝐹𝑦), ∅) = if(𝑥𝑋, (𝐹𝑥), ∅))
95 eqid 2736 . . . . . . . . . . 11 (𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)) = (𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))
96 fvex 6855 . . . . . . . . . . . 12 (𝐹𝑥) ∈ V
9796, 77ifex 4536 . . . . . . . . . . 11 if(𝑥𝑋, (𝐹𝑥), ∅) ∈ V
9894, 95, 97fvmpt 6948 . . . . . . . . . 10 (𝑥𝐵 → ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥) = if(𝑥𝑋, (𝐹𝑥), ∅))
9998ifeq2d 4506 . . . . . . . . 9 (𝑥𝐵 → if(𝑥 = 𝑋, (𝐹𝑥), ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹𝑥), if(𝑥𝑋, (𝐹𝑥), ∅)))
10091, 99eqtr3d 2778 . . . . . . . 8 (𝑥𝐵 → if(𝑥 = 𝑋, (𝐹𝑋), ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹𝑥), if(𝑥𝑋, (𝐹𝑥), ∅)))
10188, 100eqtr4id 2795 . . . . . . 7 (𝑥𝐵 → if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅) = if(𝑥 = 𝑋, (𝐹𝑋), ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥)))
102101mpteq2ia 5208 . . . . . 6 (𝑥𝐵 ↦ if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅)) = (𝑥𝐵 ↦ if(𝑥 = 𝑋, (𝐹𝑋), ((𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))‘𝑥)))
1033, 1, 2, 82, 10, 83, 87, 102cantnfp1 9617 . . . . 5 (𝜑 → ((𝑥𝐵 ↦ if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅)) ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅))) = (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))))))
104103simprd 496 . . . 4 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if((𝑥 = 𝑋𝑥𝑋), (𝐹𝑥), ∅))) = (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)))))
10565, 104eqtrd 2776 . . 3 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if(𝑥𝑋, (𝐹𝑥), ∅))) = (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)))))
106 onelon 6342 . . . . . . 7 ((𝐴 ∈ On ∧ (𝐹𝑋) ∈ 𝐴) → (𝐹𝑋) ∈ On)
1071, 83, 106syl2anc 584 . . . . . 6 (𝜑 → (𝐹𝑋) ∈ On)
108 omsuc 8472 . . . . . 6 (((𝐴o 𝑋) ∈ On ∧ (𝐹𝑋) ∈ On) → ((𝐴o 𝑋) ·o suc (𝐹𝑋)) = (((𝐴o 𝑋) ·o (𝐹𝑋)) +o (𝐴o 𝑋)))
10914, 107, 108syl2anc 584 . . . . 5 (𝜑 → ((𝐴o 𝑋) ·o suc (𝐹𝑋)) = (((𝐴o 𝑋) ·o (𝐹𝑋)) +o (𝐴o 𝑋)))
110 eloni 6327 . . . . . . . 8 ((𝐺𝑋) ∈ On → Ord (𝐺𝑋))
11120, 110syl 17 . . . . . . 7 (𝜑 → Ord (𝐺𝑋))
1129simp2d 1143 . . . . . . 7 (𝜑 → (𝐹𝑋) ∈ (𝐺𝑋))
113 ordsucss 7753 . . . . . . 7 (Ord (𝐺𝑋) → ((𝐹𝑋) ∈ (𝐺𝑋) → suc (𝐹𝑋) ⊆ (𝐺𝑋)))
114111, 112, 113sylc 65 . . . . . 6 (𝜑 → suc (𝐹𝑋) ⊆ (𝐺𝑋))
115 onsuc 7746 . . . . . . . 8 ((𝐹𝑋) ∈ On → suc (𝐹𝑋) ∈ On)
116107, 115syl 17 . . . . . . 7 (𝜑 → suc (𝐹𝑋) ∈ On)
117 omwordi 8518 . . . . . . 7 ((suc (𝐹𝑋) ∈ On ∧ (𝐺𝑋) ∈ On ∧ (𝐴o 𝑋) ∈ On) → (suc (𝐹𝑋) ⊆ (𝐺𝑋) → ((𝐴o 𝑋) ·o suc (𝐹𝑋)) ⊆ ((𝐴o 𝑋) ·o (𝐺𝑋))))
118116, 20, 14, 117syl3anc 1371 . . . . . 6 (𝜑 → (suc (𝐹𝑋) ⊆ (𝐺𝑋) → ((𝐴o 𝑋) ·o suc (𝐹𝑋)) ⊆ ((𝐴o 𝑋) ·o (𝐺𝑋))))
119114, 118mpd 15 . . . . 5 (𝜑 → ((𝐴o 𝑋) ·o suc (𝐹𝑋)) ⊆ ((𝐴o 𝑋) ·o (𝐺𝑋)))
120109, 119eqsstrrd 3983 . . . 4 (𝜑 → (((𝐴o 𝑋) ·o (𝐹𝑋)) +o (𝐴o 𝑋)) ⊆ ((𝐴o 𝑋) ·o (𝐺𝑋)))
1213, 1, 2, 82, 73, 12, 87cantnflt2 9609 . . . . 5 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ (𝐴o 𝑋))
122 onelon 6342 . . . . . . 7 (((𝐴o 𝑋) ∈ On ∧ ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ (𝐴o 𝑋)) → ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ On)
12314, 121, 122syl2anc 584 . . . . . 6 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ On)
124 omcl 8482 . . . . . . 7 (((𝐴o 𝑋) ∈ On ∧ (𝐹𝑋) ∈ On) → ((𝐴o 𝑋) ·o (𝐹𝑋)) ∈ On)
12514, 107, 124syl2anc 584 . . . . . 6 (𝜑 → ((𝐴o 𝑋) ·o (𝐹𝑋)) ∈ On)
126 oaord 8494 . . . . . 6 ((((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ On ∧ (𝐴o 𝑋) ∈ On ∧ ((𝐴o 𝑋) ·o (𝐹𝑋)) ∈ On) → (((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ (𝐴o 𝑋) ↔ (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)))) ∈ (((𝐴o 𝑋) ·o (𝐹𝑋)) +o (𝐴o 𝑋))))
127123, 14, 125, 126syl3anc 1371 . . . . 5 (𝜑 → (((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅))) ∈ (𝐴o 𝑋) ↔ (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)))) ∈ (((𝐴o 𝑋) ·o (𝐹𝑋)) +o (𝐴o 𝑋))))
128121, 127mpbid 231 . . . 4 (𝜑 → (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)))) ∈ (((𝐴o 𝑋) ·o (𝐹𝑋)) +o (𝐴o 𝑋)))
129120, 128sseldd 3945 . . 3 (𝜑 → (((𝐴o 𝑋) ·o (𝐹𝑋)) +o ((𝐴 CNF 𝐵)‘(𝑦𝐵 ↦ if(𝑦𝑋, (𝐹𝑦), ∅)))) ∈ ((𝐴o 𝑋) ·o (𝐺𝑋)))
130105, 129eqeltrd 2838 . 2 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if(𝑥𝑋, (𝐹𝑥), ∅))) ∈ ((𝐴o 𝑋) ·o (𝐺𝑋)))
13154, 130sseldd 3945 1 (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥𝐵 ↦ if(𝑥𝑋, (𝐹𝑥), ∅))) ∈ (𝐻‘suc (𝑂𝑋)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  wo 845   = wceq 1541  wcel 2106  wne 2943  wral 3064  wrex 3073  {crab 3407  Vcvv 3445  cdif 3907  wss 3910  c0 4282  ifcif 4486   cuni 4865   class class class wbr 5105  {copab 5167  cmpt 5188   E cep 5536   We wwe 5587  ccnv 5632  dom cdm 5633  Ord word 6316  Oncon0 6317  suc csuc 6319  wf 6492  1-1-ontowf1o 6495  cfv 6496   Isom wiso 6497  (class class class)co 7357  cmpo 7359  ωcom 7802   supp csupp 8092  seqωcseqom 8393   +o coa 8409   ·o comu 8410  o coe 8411   finSupp cfsupp 9305  OrdIsocoi 9445   CNF ccnf 9597
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 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
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 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-se 5589  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-supp 8093  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-seqom 8394  df-1o 8412  df-2o 8413  df-oadd 8416  df-omul 8417  df-oexp 8418  df-er 8648  df-map 8767  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-fsupp 9306  df-oi 9446  df-cnf 9598
This theorem is referenced by:  cantnflem1  9625
  Copyright terms: Public domain W3C validator