cantnflem1d - Metamath Proof Explorer

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

Theorem cantnflem1d 9729

Description: Lemma for cantnf 9734. (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**
Step	Hyp	Ref	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 ⊢ 𝑋 = ∪ {𝑐 ∈ 𝐵 ∣ (𝐹‘𝑐) ∈ (𝐺‘𝑐)}
9	3, 1, 2, 4, 5, 6, 7, 8	oemapvali 9725	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ∧ (𝐹‘𝑋) ∈ (𝐺‘𝑋) ∧ ∀𝑤 ∈ 𝐵 (𝑋 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))
10	9	simp1d 1142	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
11		onelon 6408	. . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ On)
12	2, 10, 11	syl2anc 584	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ On)
13		oecl 8576	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑_o 𝑋) ∈ On)
14	1, 12, 13	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝐴 ↑_o 𝑋) ∈ On)
15	3, 1, 2	cantnfs 9707	. . . . . . . . 9 ⊢ (𝜑 → (𝐺 ∈ 𝑆 ↔ (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅)))
16	6, 15	mpbid 232	. . . . . . . 8 ⊢ (𝜑 → (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅))
17	16	simpld 494	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
18	17, 10	ffvelcdmd 7104	. . . . . 6 ⊢ (𝜑 → (𝐺‘𝑋) ∈ 𝐴)
19		onelon 6408	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ (𝐺‘𝑋) ∈ 𝐴) → (𝐺‘𝑋) ∈ On)
20	1, 18, 19	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝐺‘𝑋) ∈ On)
21		omcl 8575	. . . . 5 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ (𝐺‘𝑋) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ∈ On)
22	14, 20, 21	syl2anc 584	. . . 4 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ∈ On)
23		ovexd 7467	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺 supp ∅) ∈ V)
24		cantnflem1.o	. . . . . . . . . . . 12 ⊢ 𝑂 = OrdIso( E , (𝐺 supp ∅))
25	3, 1, 2, 24, 6	cantnfcl 9708	. . . . . . . . . . 11 ⊢ (𝜑 → ( E We (𝐺 supp ∅) ∧ dom 𝑂 ∈ ω))
26	25	simpld 494	. . . . . . . . . 10 ⊢ (𝜑 → E We (𝐺 supp ∅))
27	24	oiiso 9578	. . . . . . . . . 10 ⊢ (((𝐺 supp ∅) ∈ V ∧ E We (𝐺 supp ∅)) → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
28	23, 26, 27	syl2anc 584	. . . . . . . . 9 ⊢ (𝜑 → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
29		isof1o 7344	. . . . . . . . 9 ⊢ (𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)) → 𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅))
30	28, 29	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅))
31		f1ocnv 6859	. . . . . . . 8 ⊢ (𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅) → ^◡𝑂:(𝐺 supp ∅)–1-1-onto→dom 𝑂)
32		f1of 6847	. . . . . . . 8 ⊢ (^◡𝑂:(𝐺 supp ∅)–1-1-onto→dom 𝑂 → ^◡𝑂:(𝐺 supp ∅)⟶dom 𝑂)
33	30, 31, 32	3syl 18	. . . . . . 7 ⊢ (𝜑 → ^◡𝑂:(𝐺 supp ∅)⟶dom 𝑂)
34	3, 1, 2, 4, 5, 6, 7, 8	cantnflem1a 9726	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ (𝐺 supp ∅))
35	33, 34	ffvelcdmd 7104	. . . . . 6 ⊢ (𝜑 → (^◡𝑂‘𝑋) ∈ dom 𝑂)
36	25	simprd 495	. . . . . 6 ⊢ (𝜑 → dom 𝑂 ∈ ω)
37		elnn 7899	. . . . . 6 ⊢ (((^◡𝑂‘𝑋) ∈ dom 𝑂 ∧ dom 𝑂 ∈ ω) → (^◡𝑂‘𝑋) ∈ ω)
38	35, 36, 37	syl2anc 584	. . . . 5 ⊢ (𝜑 → (^◡𝑂‘𝑋) ∈ ω)
39		cantnflem1.h	. . . . . . 7 ⊢ 𝐻 = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (𝑂‘𝑘)) ·_o (𝐺‘(𝑂‘𝑘))) +_o 𝑧)), ∅)
40	39	cantnfvalf 9706	. . . . . 6 ⊢ 𝐻:ω⟶On
41	40	ffvelcdmi 7102	. . . . 5 ⊢ ((^◡𝑂‘𝑋) ∈ ω → (𝐻‘(^◡𝑂‘𝑋)) ∈ On)
42	38, 41	syl 17	. . . 4 ⊢ (𝜑 → (𝐻‘(^◡𝑂‘𝑋)) ∈ On)
43		oaword1 8591	. . . 4 ⊢ ((((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ∈ On ∧ (𝐻‘(^◡𝑂‘𝑋)) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ⊆ (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
44	22, 42, 43	syl2anc 584	. . 3 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ⊆ (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
45	3, 1, 2, 24, 6, 39	cantnfsuc 9711	. . . . 5 ⊢ ((𝜑 ∧ (^◡𝑂‘𝑋) ∈ ω) → (𝐻‘suc (^◡𝑂‘𝑋)) = (((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) +_o (𝐻‘(^◡𝑂‘𝑋))))
46	38, 45	mpdan 687	. . . 4 ⊢ (𝜑 → (𝐻‘suc (^◡𝑂‘𝑋)) = (((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) +_o (𝐻‘(^◡𝑂‘𝑋))))
47		f1ocnvfv2 7298	. . . . . . . 8 ⊢ ((𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅) ∧ 𝑋 ∈ (𝐺 supp ∅)) → (𝑂‘(^◡𝑂‘𝑋)) = 𝑋)
48	30, 34, 47	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → (𝑂‘(^◡𝑂‘𝑋)) = 𝑋)
49	48	oveq2d 7448	. . . . . 6 ⊢ (𝜑 → (𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) = (𝐴 ↑_o 𝑋))
50	48	fveq2d 6909	. . . . . 6 ⊢ (𝜑 → (𝐺‘(𝑂‘(^◡𝑂‘𝑋))) = (𝐺‘𝑋))
51	49, 50	oveq12d 7450	. . . . 5 ⊢ (𝜑 → ((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) = ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
52	51	oveq1d 7447	. . . 4 ⊢ (𝜑 → (((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) +_o (𝐻‘(^◡𝑂‘𝑋))) = (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
53	46, 52	eqtrd 2776	. . 3 ⊢ (𝜑 → (𝐻‘suc (^◡𝑂‘𝑋)) = (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
54	44, 53	sseqtrrd 4020	. 2 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ⊆ (𝐻‘suc (^◡𝑂‘𝑋)))
55		onss 7806	. . . . . . . . . . 11 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On)
56	2, 55	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ⊆ On)
57	56	sselda 3982	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
58	12	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ On)
59		onsseleq 6424	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑋 ∈ On) → (𝑥 ⊆ 𝑋 ↔ (𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋)))
60	57, 58, 59	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ⊆ 𝑋 ↔ (𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋)))
61		orcom 870	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋) ↔ (𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋))
62	60, 61	bitrdi 287	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ⊆ 𝑋 ↔ (𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋)))
63	62	ifbid 4548	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅) = if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))
64	63	mpteq2dva 5241	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅)) = (𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅)))
65	64	fveq2d 6909	. . . 4 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) = ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))))
66	3, 1, 2	cantnfs 9707	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅)))
67	5, 66	mpbid 232	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))
68	67	simpld 494	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐵⟶𝐴)
69	68	ffvelcdmda 7103	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) ∈ 𝐴)
70	18	ne0d 4341	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ≠ ∅)
71		on0eln0 6439	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
72	1, 71	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
73	70, 72	mpbird 257	. . . . . . . . . 10 ⊢ (𝜑 → ∅ ∈ 𝐴)
74	73	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ∅ ∈ 𝐴)
75	69, 74	ifcld 4571	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅) ∈ 𝐴)
76	75	fmpttd 7134	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)):𝐵⟶𝐴)
77		0ex 5306	. . . . . . . . 9 ⊢ ∅ ∈ V
78	77	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ V)
79	67	simprd 495	. . . . . . . 8 ⊢ (𝜑 → 𝐹 finSupp ∅)
80	68, 2, 78, 79	fsuppmptif 9440	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) finSupp ∅)
81	3, 1, 2	cantnfs 9707	. . . . . . 7 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) ∈ 𝑆 ↔ ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)):𝐵⟶𝐴 ∧ (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) finSupp ∅)))
82	76, 80, 81	mpbir2and 713	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) ∈ 𝑆)
83	68, 10	ffvelcdmd 7104	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐴)
84		eldifn 4131	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝐵 ∖ 𝑋) → ¬ 𝑦 ∈ 𝑋)
85	84	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐵 ∖ 𝑋)) → ¬ 𝑦 ∈ 𝑋)
86	85	iffalsed 4535	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐵 ∖ 𝑋)) → if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅) = ∅)
87	86, 2	suppss2 8226	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) supp ∅) ⊆ 𝑋)
88		ifor 4579	. . . . . . . 8 ⊢ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅) = if(𝑥 = 𝑋, (𝐹‘𝑥), if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅))
89		fveq2 6905	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
90	89	adantl 481	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 = 𝑋) → (𝐹‘𝑥) = (𝐹‘𝑋))
91	90	ifeq1da 4556	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → if(𝑥 = 𝑋, (𝐹‘𝑥), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)))
92		eleq1w 2823	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑋 ↔ 𝑥 ∈ 𝑋))
93		fveq2 6905	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
94	92, 93	ifbieq1d 4549	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅) = if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅))
95		eqid 2736	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) = (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))
96		fvex 6918	. . . . . . . . . . . 12 ⊢ (𝐹‘𝑥) ∈ V
97	96, 77	ifex 4575	. . . . . . . . . . 11 ⊢ if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅) ∈ V
98	94, 95, 97	fvmpt 7015	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥) = if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅))
99	98	ifeq2d 4545	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → if(𝑥 = 𝑋, (𝐹‘𝑥), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹‘𝑥), if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅)))
100	91, 99	eqtr3d 2778	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹‘𝑥), if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅)))
101	88, 100	eqtr4id 2795	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅) = if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)))
102	101	mpteq2ia 5244	. . . . . 6 ⊢ (𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅)) = (𝑥 ∈ 𝐵 ↦ if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)))
103	3, 1, 2, 82, 10, 83, 87, 102	cantnfp1 9722	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅)) ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))))))
104	103	simprd 495	. . . 4 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))))
105	65, 104	eqtrd 2776	. . 3 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))))
106		onelon 6408	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ (𝐹‘𝑋) ∈ 𝐴) → (𝐹‘𝑋) ∈ On)
107	1, 83, 106	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝑋) ∈ On)
108		omsuc 8565	. . . . . 6 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ (𝐹‘𝑋) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)))
109	14, 107, 108	syl2anc 584	. . . . 5 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)))
110		eloni 6393	. . . . . . . 8 ⊢ ((𝐺‘𝑋) ∈ On → Ord (𝐺‘𝑋))
111	20, 110	syl 17	. . . . . . 7 ⊢ (𝜑 → Ord (𝐺‘𝑋))
112	9	simp2d 1143	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (𝐺‘𝑋))
113		ordsucss 7839	. . . . . . 7 ⊢ (Ord (𝐺‘𝑋) → ((𝐹‘𝑋) ∈ (𝐺‘𝑋) → suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋)))
114	111, 112, 113	sylc 65	. . . . . 6 ⊢ (𝜑 → suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋))
115		onsuc 7832	. . . . . . . 8 ⊢ ((𝐹‘𝑋) ∈ On → suc (𝐹‘𝑋) ∈ On)
116	107, 115	syl 17	. . . . . . 7 ⊢ (𝜑 → suc (𝐹‘𝑋) ∈ On)
117		omwordi 8610	. . . . . . 7 ⊢ ((suc (𝐹‘𝑋) ∈ On ∧ (𝐺‘𝑋) ∈ On ∧ (𝐴 ↑_o 𝑋) ∈ On) → (suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋) → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋))))
118	116, 20, 14, 117	syl3anc 1372	. . . . . 6 ⊢ (𝜑 → (suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋) → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋))))
119	114, 118	mpd 15	. . . . 5 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
120	109, 119	eqsstrrd 4018	. . . 4 ⊢ (𝜑 → (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
121	3, 1, 2, 82, 73, 12, 87	cantnflt2 9714	. . . . 5 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋))
122		onelon 6408	. . . . . . 7 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋)) → ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ On)
123	14, 121, 122	syl2anc 584	. . . . . 6 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ On)
124		omcl 8575	. . . . . . 7 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ (𝐹‘𝑋) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) ∈ On)
125	14, 107, 124	syl2anc 584	. . . . . 6 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) ∈ On)
126		oaord 8586	. . . . . 6 ⊢ ((((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ On ∧ (𝐴 ↑_o 𝑋) ∈ On ∧ ((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) ∈ On) → (((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋) ↔ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋))))
127	123, 14, 125, 126	syl3anc 1372	. . . . 5 ⊢ (𝜑 → (((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋) ↔ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋))))
128	121, 127	mpbid 232	. . . 4 ⊢ (𝜑 → (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)))
129	120, 128	sseldd 3983	. . 3 ⊢ (𝜑 → (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
130	105, 129	eqeltrd 2840	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) ∈ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
131	54, 130	sseldd 3983	1 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) ∈ (𝐻‘suc (^◡𝑂‘𝑋)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1539 ∈ wcel 2107 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 {crab 3435 Vcvv 3479 ∖ cdif 3947 ⊆ wss 3950 ∅c0 4332 ifcif 4524 ∪ cuni 4906 class class class wbr 5142 {copab 5204 ↦ cmpt 5224 E cep 5582 We wwe 5635 ^◡ccnv 5683 dom cdm 5684 Ord word 6382 Oncon0 6383 suc csuc 6385 ⟶wf 6556 –1-1-onto→wf1o 6559 ‘cfv 6560 Isom wiso 6561 (class class class)co 7432 ∈ cmpo 7434 ωcom 7888 supp csupp 8186 seq_ωcseqom 8488 +_o coa 8504 ·_o comu 8505 ↑_o coe 8506 finSupp cfsupp 9402 OrdIsocoi 9550 CNF ccnf 9702

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5278 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-se 5637 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-isom 6569 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-1st 8015 df-2nd 8016 df-supp 8187 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-seqom 8489 df-1o 8507 df-2o 8508 df-oadd 8511 df-omul 8512 df-oexp 8513 df-er 8746 df-map 8869 df-en 8987 df-dom 8988 df-sdom 8989 df-fin 8990 df-fsupp 9403 df-oi 9551 df-cnf 9703

This theorem is referenced by: cantnflem1 9730

W3C validator