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 9600

Description: Lemma for cantnf 9605. (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 9596	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ∧ (𝐹‘𝑋) ∈ (𝐺‘𝑋) ∧ ∀𝑤 ∈ 𝐵 (𝑋 ∈ 𝑤 → (𝐹‘𝑤) = (𝐺‘𝑤))))
10	9	simp1d 1148	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
11		onelon 6335	. . . . . . 7 ⊢ ((𝐵 ∈ On ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ On)
12	2, 10, 11	syl2anc 590	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ On)
13		oecl 8462	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑_o 𝑋) ∈ On)
14	1, 12, 13	syl2anc 590	. . . . 5 ⊢ (𝜑 → (𝐴 ↑_o 𝑋) ∈ On)
15	3, 1, 2	cantnfs 9578	. . . . . . . . 9 ⊢ (𝜑 → (𝐺 ∈ 𝑆 ↔ (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅)))
16	6, 15	mpbid 233	. . . . . . . 8 ⊢ (𝜑 → (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅))
17	16	simpld 495	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
18	17, 10	ffvelcdmd 7026	. . . . . 6 ⊢ (𝜑 → (𝐺‘𝑋) ∈ 𝐴)
19		onelon 6335	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ (𝐺‘𝑋) ∈ 𝐴) → (𝐺‘𝑋) ∈ On)
20	1, 18, 19	syl2anc 590	. . . . 5 ⊢ (𝜑 → (𝐺‘𝑋) ∈ On)
21		omcl 8461	. . . . 5 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ (𝐺‘𝑋) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ∈ On)
22	14, 20, 21	syl2anc 590	. . . 4 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ∈ On)
23		ovexd 7391	. . . . . . . . . 10 ⊢ (𝜑 → (𝐺 supp ∅) ∈ V)
24		cantnflem1.o	. . . . . . . . . . . 12 ⊢ 𝑂 = OrdIso( E , (𝐺 supp ∅))
25	3, 1, 2, 24, 6	cantnfcl 9579	. . . . . . . . . . 11 ⊢ (𝜑 → ( E We (𝐺 supp ∅) ∧ dom 𝑂 ∈ ω))
26	25	simpld 495	. . . . . . . . . 10 ⊢ (𝜑 → E We (𝐺 supp ∅))
27	24	oiiso 9442	. . . . . . . . . 10 ⊢ (((𝐺 supp ∅) ∈ V ∧ E We (𝐺 supp ∅)) → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
28	23, 26, 27	syl2anc 590	. . . . . . . . 9 ⊢ (𝜑 → 𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)))
29		isof1o 7267	. . . . . . . . 9 ⊢ (𝑂 Isom E , E (dom 𝑂, (𝐺 supp ∅)) → 𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅))
30	28, 29	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅))
31		f1ocnv 6779	. . . . . . . 8 ⊢ (𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅) → ^◡𝑂:(𝐺 supp ∅)–1-1-onto→dom 𝑂)
32		f1of 6767	. . . . . . . 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 9597	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ (𝐺 supp ∅))
35	33, 34	ffvelcdmd 7026	. . . . . 6 ⊢ (𝜑 → (^◡𝑂‘𝑋) ∈ dom 𝑂)
36	25	simprd 496	. . . . . 6 ⊢ (𝜑 → dom 𝑂 ∈ ω)
37		elnn 7817	. . . . . 6 ⊢ (((^◡𝑂‘𝑋) ∈ dom 𝑂 ∧ dom 𝑂 ∈ ω) → (^◡𝑂‘𝑋) ∈ ω)
38	35, 36, 37	syl2anc 590	. . . . 5 ⊢ (𝜑 → (^◡𝑂‘𝑋) ∈ ω)
39		cantnflem1.h	. . . . . . 7 ⊢ 𝐻 = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (𝑂‘𝑘)) ·_o (𝐺‘(𝑂‘𝑘))) +_o 𝑧)), ∅)
40	39	cantnfvalf 9577	. . . . . 6 ⊢ 𝐻:ω⟶On
41	40	ffvelcdmi 7024	. . . . 5 ⊢ ((^◡𝑂‘𝑋) ∈ ω → (𝐻‘(^◡𝑂‘𝑋)) ∈ On)
42	38, 41	syl 17	. . . 4 ⊢ (𝜑 → (𝐻‘(^◡𝑂‘𝑋)) ∈ On)
43		oaword1 8477	. . . 4 ⊢ ((((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ∈ On ∧ (𝐻‘(^◡𝑂‘𝑋)) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ⊆ (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
44	22, 42, 43	syl2anc 590	. . 3 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ⊆ (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
45	3, 1, 2, 24, 6, 39	cantnfsuc 9582	. . . . 5 ⊢ ((𝜑 ∧ (^◡𝑂‘𝑋) ∈ ω) → (𝐻‘suc (^◡𝑂‘𝑋)) = (((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) +_o (𝐻‘(^◡𝑂‘𝑋))))
46	38, 45	mpdan 693	. . . 4 ⊢ (𝜑 → (𝐻‘suc (^◡𝑂‘𝑋)) = (((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) +_o (𝐻‘(^◡𝑂‘𝑋))))
47		f1ocnvfv2 7221	. . . . . . . 8 ⊢ ((𝑂:dom 𝑂–1-1-onto→(𝐺 supp ∅) ∧ 𝑋 ∈ (𝐺 supp ∅)) → (𝑂‘(^◡𝑂‘𝑋)) = 𝑋)
48	30, 34, 47	syl2anc 590	. . . . . . 7 ⊢ (𝜑 → (𝑂‘(^◡𝑂‘𝑋)) = 𝑋)
49	48	oveq2d 7372	. . . . . 6 ⊢ (𝜑 → (𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) = (𝐴 ↑_o 𝑋))
50	48	fveq2d 6831	. . . . . 6 ⊢ (𝜑 → (𝐺‘(𝑂‘(^◡𝑂‘𝑋))) = (𝐺‘𝑋))
51	49, 50	oveq12d 7374	. . . . 5 ⊢ (𝜑 → ((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) = ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
52	51	oveq1d 7371	. . . 4 ⊢ (𝜑 → (((𝐴 ↑_o (𝑂‘(^◡𝑂‘𝑋))) ·_o (𝐺‘(𝑂‘(^◡𝑂‘𝑋)))) +_o (𝐻‘(^◡𝑂‘𝑋))) = (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
53	46, 52	eqtrd 2774	. . 3 ⊢ (𝜑 → (𝐻‘suc (^◡𝑂‘𝑋)) = (((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) +_o (𝐻‘(^◡𝑂‘𝑋))))
54	44, 53	sseqtrrd 3952	. 2 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)) ⊆ (𝐻‘suc (^◡𝑂‘𝑋)))
55		onss 7728	. . . . . . . . . . 11 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On)
56	2, 55	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ⊆ On)
57	56	sselda 3915	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
58	12	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑋 ∈ On)
59		onsseleq 6351	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑋 ∈ On) → (𝑥 ⊆ 𝑋 ↔ (𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋)))
60	57, 58, 59	syl2anc 590	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ⊆ 𝑋 ↔ (𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋)))
61		orcom 876	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑋 ∨ 𝑥 = 𝑋) ↔ (𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋))
62	60, 61	bitrdi 288	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥 ⊆ 𝑋 ↔ (𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋)))
63	62	ifbid 4478	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅) = if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))
64	63	mpteq2dva 5165	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅)) = (𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅)))
65	64	fveq2d 6831	. . . 4 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) = ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))))
66	3, 1, 2	cantnfs 9578	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅)))
67	5, 66	mpbid 233	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐹:𝐵⟶𝐴 ∧ 𝐹 finSupp ∅))
68	67	simpld 495	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐵⟶𝐴)
69	68	ffvelcdmda 7025	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝐹‘𝑦) ∈ 𝐴)
70	18	ne0d 4270	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ≠ ∅)
71		on0eln0 6367	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
72	1, 71	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
73	70, 72	mpbird 258	. . . . . . . . . 10 ⊢ (𝜑 → ∅ ∈ 𝐴)
74	73	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → ∅ ∈ 𝐴)
75	69, 74	ifcld 4501	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅) ∈ 𝐴)
76	75	fmpttd 7056	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)):𝐵⟶𝐴)
77		0ex 5229	. . . . . . . . 9 ⊢ ∅ ∈ V
78	77	a1i 11	. . . . . . . 8 ⊢ (𝜑 → ∅ ∈ V)
79	67	simprd 496	. . . . . . . 8 ⊢ (𝜑 → 𝐹 finSupp ∅)
80	68, 2, 78, 79	fsuppmptif 9302	. . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) finSupp ∅)
81	3, 1, 2	cantnfs 9578	. . . . . . 7 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) ∈ 𝑆 ↔ ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)):𝐵⟶𝐴 ∧ (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) finSupp ∅)))
82	76, 80, 81	mpbir2and 719	. . . . . 6 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) ∈ 𝑆)
83	68, 10	ffvelcdmd 7026	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝑋) ∈ 𝐴)
84		eldifn 4062	. . . . . . . . 9 ⊢ (𝑦 ∈ (𝐵 ∖ 𝑋) → ¬ 𝑦 ∈ 𝑋)
85	84	adantl 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐵 ∖ 𝑋)) → ¬ 𝑦 ∈ 𝑋)
86	85	iffalsed 4465	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 ∈ (𝐵 ∖ 𝑋)) → if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅) = ∅)
87	86, 2	suppss2 8140	. . . . . 6 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) supp ∅) ⊆ 𝑋)
88		ifor 4509	. . . . . . . 8 ⊢ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅) = if(𝑥 = 𝑋, (𝐹‘𝑥), if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅))
89		fveq2 6827	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
90	89	adantl 482	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥 = 𝑋) → (𝐹‘𝑥) = (𝐹‘𝑋))
91	90	ifeq1da 4486	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → if(𝑥 = 𝑋, (𝐹‘𝑥), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)))
92		eleq1w 2822	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝑋 ↔ 𝑥 ∈ 𝑋))
93		fveq2 6827	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑥 → (𝐹‘𝑦) = (𝐹‘𝑥))
94	92, 93	ifbieq1d 4479	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅) = if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅))
95		eqid 2739	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)) = (𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))
96		fvex 6840	. . . . . . . . . . . 12 ⊢ (𝐹‘𝑥) ∈ V
97	96, 77	ifex 4505	. . . . . . . . . . 11 ⊢ if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅) ∈ V
98	94, 95, 97	fvmpt 6935	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥) = if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅))
99	98	ifeq2d 4475	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → if(𝑥 = 𝑋, (𝐹‘𝑥), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹‘𝑥), if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅)))
100	91, 99	eqtr3d 2776	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐵 → if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)) = if(𝑥 = 𝑋, (𝐹‘𝑥), if(𝑥 ∈ 𝑋, (𝐹‘𝑥), ∅)))
101	88, 100	eqtr4id 2793	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 → if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅) = if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)))
102	101	mpteq2ia 5167	. . . . . 6 ⊢ (𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅)) = (𝑥 ∈ 𝐵 ↦ if(𝑥 = 𝑋, (𝐹‘𝑋), ((𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))‘𝑥)))
103	3, 1, 2, 82, 10, 83, 87, 102	cantnfp1 9593	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅)) ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))))))
104	103	simprd 496	. . . 4 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if((𝑥 = 𝑋 ∨ 𝑥 ∈ 𝑋), (𝐹‘𝑥), ∅))) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))))
105	65, 104	eqtrd 2774	. . 3 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))))
106		onelon 6335	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ (𝐹‘𝑋) ∈ 𝐴) → (𝐹‘𝑋) ∈ On)
107	1, 83, 106	syl2anc 590	. . . . . 6 ⊢ (𝜑 → (𝐹‘𝑋) ∈ On)
108		omsuc 8451	. . . . . 6 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ (𝐹‘𝑋) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)))
109	14, 107, 108	syl2anc 590	. . . . 5 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) = (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)))
110		eloni 6320	. . . . . . . 8 ⊢ ((𝐺‘𝑋) ∈ On → Ord (𝐺‘𝑋))
111	20, 110	syl 17	. . . . . . 7 ⊢ (𝜑 → Ord (𝐺‘𝑋))
112	9	simp2d 1149	. . . . . . 7 ⊢ (𝜑 → (𝐹‘𝑋) ∈ (𝐺‘𝑋))
113		ordsucss 7758	. . . . . . 7 ⊢ (Ord (𝐺‘𝑋) → ((𝐹‘𝑋) ∈ (𝐺‘𝑋) → suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋)))
114	111, 112, 113	sylc 65	. . . . . 6 ⊢ (𝜑 → suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋))
115		onsuc 7753	. . . . . . . 8 ⊢ ((𝐹‘𝑋) ∈ On → suc (𝐹‘𝑋) ∈ On)
116	107, 115	syl 17	. . . . . . 7 ⊢ (𝜑 → suc (𝐹‘𝑋) ∈ On)
117		omwordi 8496	. . . . . . 7 ⊢ ((suc (𝐹‘𝑋) ∈ On ∧ (𝐺‘𝑋) ∈ On ∧ (𝐴 ↑_o 𝑋) ∈ On) → (suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋) → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋))))
118	116, 20, 14, 117	syl3anc 1379	. . . . . 6 ⊢ (𝜑 → (suc (𝐹‘𝑋) ⊆ (𝐺‘𝑋) → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋))))
119	114, 118	mpd 15	. . . . 5 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o suc (𝐹‘𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
120	109, 119	eqsstrrd 3950	. . . 4 ⊢ (𝜑 → (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)) ⊆ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
121	3, 1, 2, 82, 73, 12, 87	cantnflt2 9585	. . . . 5 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋))
122		onelon 6335	. . . . . . 7 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋)) → ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ On)
123	14, 121, 122	syl2anc 590	. . . . . 6 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ On)
124		omcl 8461	. . . . . . 7 ⊢ (((𝐴 ↑_o 𝑋) ∈ On ∧ (𝐹‘𝑋) ∈ On) → ((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) ∈ On)
125	14, 107, 124	syl2anc 590	. . . . . 6 ⊢ (𝜑 → ((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) ∈ On)
126		oaord 8472	. . . . . 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 1379	. . . . 5 ⊢ (𝜑 → (((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅))) ∈ (𝐴 ↑_o 𝑋) ↔ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋))))
128	121, 127	mpbid 233	. . . 4 ⊢ (𝜑 → (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o (𝐴 ↑_o 𝑋)))
129	120, 128	sseldd 3916	. . 3 ⊢ (𝜑 → (((𝐴 ↑_o 𝑋) ·_o (𝐹‘𝑋)) +_o ((𝐴 CNF 𝐵)‘(𝑦 ∈ 𝐵 ↦ if(𝑦 ∈ 𝑋, (𝐹‘𝑦), ∅)))) ∈ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
130	105, 129	eqeltrd 2839	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) ∈ ((𝐴 ↑_o 𝑋) ·_o (𝐺‘𝑋)))
131	54, 130	sseldd 3916	1 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑥 ∈ 𝐵 ↦ if(𝑥 ⊆ 𝑋, (𝐹‘𝑥), ∅))) ∈ (𝐻‘suc (^◡𝑂‘𝑋)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 853 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ∀wral 3053 ∃wrex 3063 {crab 3391 Vcvv 3431 ∖ cdif 3880 ⊆ wss 3883 ∅c0 4261 ifcif 4454 ∪ cuni 4838 class class class wbr 5072 {copab 5134 ↦ cmpt 5153 E cep 5517 We wwe 5570 ^◡ccnv 5617 dom cdm 5618 Ord word 6309 Oncon0 6310 suc csuc 6312 ⟶wf 6481 –1-1-onto→wf1o 6484 ‘cfv 6485 Isom wiso 6486 (class class class)co 7356 ∈ cmpo 7358 ωcom 7806 supp csupp 8100 seq_ωcseqom 8376 +_o coa 8392 ·_o comu 8393 ↑_o coe 8394 finSupp cfsupp 9264 OrdIsocoi 9414 CNF ccnf 9573

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-supp 8101 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-seqom 8377 df-1o 8395 df-2o 8396 df-oadd 8399 df-omul 8400 df-oexp 8401 df-er 8633 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fsupp 9265 df-oi 9415 df-cnf 9574

This theorem is referenced by: cantnflem1 9601

W3C validator