Theorem cantnflem3 9606

Description: Lemma for cantnf 9608. Here we show existence of Cantor normal forms. Assuming (by transfinite induction) that every number less than 𝐶 has a normal form, we can use oeeu 8533 to factor 𝐶 into the form ((𝐴 ↑_o 𝑋) ·_o 𝑌) +_o 𝑍 where 0 < 𝑌 < 𝐴 and 𝑍 < (𝐴 ↑_o 𝑋) (and a fortiori 𝑋 < 𝐵). Then since 𝑍 < (𝐴 ↑_o 𝑋) ≤ (𝐴 ↑_o 𝑋) ·_o 𝑌 ≤ 𝐶, 𝑍 has a normal form, and by appending the term (𝐴 ↑_o 𝑋) ·_o 𝑌 using cantnfp1 9596 we get a normal form for 𝐶. (Contributed by Mario Carneiro, 28-May-2015.)

Hypotheses

Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
oemapval.t	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
cantnf.c	⊢ (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
cantnf.s	⊢ (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
cantnf.e	⊢ (𝜑 → ∅ ∈ 𝐶)
cantnf.x	⊢ 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
cantnf.p	⊢ 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
cantnf.y	⊢ 𝑌 = (1st ‘𝑃)
cantnf.z	⊢ 𝑍 = (2nd ‘𝑃)
cantnf.g	⊢ (𝜑 → 𝐺 ∈ 𝑆)
cantnf.v	⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) = 𝑍)
cantnf.f	⊢ 𝐹 = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)))

Assertion

Ref	Expression
cantnflem3	⊢ (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))

Distinct variable groups:   𝑡,𝑐,𝑤,𝑥,𝑦,𝑧,𝐵   𝑎,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧,𝐶   𝑡,𝑎,𝐴,𝑏,𝑐,𝑑,𝑤,𝑥,𝑦,𝑧   𝑇,𝑐,𝑡   𝑤,𝐹,𝑥,𝑦,𝑧   𝑆,𝑐,𝑡,𝑥,𝑦,𝑧   𝑡,𝑍,𝑥,𝑦,𝑧   𝐺,𝑐,𝑡,𝑤,𝑥,𝑦,𝑧   𝜑,𝑡,𝑥,𝑦,𝑧   𝑡,𝑌,𝑤,𝑥,𝑦,𝑧   𝑋,𝑎,𝑏,𝑑,𝑡,𝑤,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑤,𝑎,𝑏,𝑐,𝑑)   𝐵(𝑎,𝑏,𝑑)   𝐶(𝑡)   𝑃(𝑥,𝑦,𝑧,𝑤,𝑡,𝑎,𝑏,𝑐,𝑑)   𝑆(𝑤,𝑎,𝑏,𝑑)   𝑇(𝑥,𝑦,𝑧,𝑤,𝑎,𝑏,𝑑)   𝐹(𝑡,𝑎,𝑏,𝑐,𝑑)   𝐺(𝑎,𝑏,𝑑)   𝑋(𝑐)   𝑌(𝑎,𝑏,𝑐,𝑑)   𝑍(𝑤,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem cantnflem3

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cantnfs.s	. . . . 5 ⊢ 𝑆 = dom (𝐴 CNF 𝐵)
2		cantnfs.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ On)
3		cantnfs.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ On)
4		cantnf.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ 𝑆)
5		oemapval.t	. . . . . . . . . . . . . 14 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
6		cantnf.c	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ∈ (𝐴 ↑o 𝐵))
7		cantnf.s	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐶 ⊆ ran (𝐴 CNF 𝐵))
8		cantnf.e	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∅ ∈ 𝐶)
9	1, 2, 3, 5, 6, 7, 8	cantnflem2 9605	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)))
10		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ 𝑋 = 𝑋
11		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ 𝑌 = 𝑌
12		eqid 2737	. . . . . . . . . . . . . . 15 ⊢ 𝑍 = 𝑍
13	10, 11, 12	3pm3.2i 1341	. . . . . . . . . . . . . 14 ⊢ (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)
14		cantnf.x	. . . . . . . . . . . . . . 15 ⊢ 𝑋 = ∪ ∩ {𝑐 ∈ On ∣ 𝐶 ∈ (𝐴 ↑o 𝑐)}
15		cantnf.p	. . . . . . . . . . . . . . 15 ⊢ 𝑃 = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑o 𝑋)(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑o 𝑋) ·o 𝑎) +o 𝑏) = 𝐶))
16		cantnf.y	. . . . . . . . . . . . . . 15 ⊢ 𝑌 = (1st ‘𝑃)
17		cantnf.z	. . . . . . . . . . . . . . 15 ⊢ 𝑍 = (2nd ‘𝑃)
18	14, 15, 16, 17	oeeui 8532	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → (((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶) ↔ (𝑋 = 𝑋 ∧ 𝑌 = 𝑌 ∧ 𝑍 = 𝑍)))
19	13, 18	mpbiri 258	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ (On ∖ 2o) ∧ 𝐶 ∈ (On ∖ 1o)) → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
20	9, 19	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) ∧ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶))
21	20	simpld 494	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑋 ∈ On ∧ 𝑌 ∈ (𝐴 ∖ 1o) ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)))
22	21	simp1d 1143	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ On)
23		oecl 8466	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝑋 ∈ On) → (𝐴 ↑o 𝑋) ∈ On)
24	2, 22, 23	syl2anc 585	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 ↑o 𝑋) ∈ On)
25	21	simp2d 1144	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑌 ∈ (𝐴 ∖ 1o))
26	25	eldifad 3902	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ 𝐴)
27		onelon 6343	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ On)
28	2, 26, 27	syl2anc 585	. . . . . . . . 9 ⊢ (𝜑 → 𝑌 ∈ On)
29		dif1o 8429	. . . . . . . . . . . 12 ⊢ (𝑌 ∈ (𝐴 ∖ 1o) ↔ (𝑌 ∈ 𝐴 ∧ 𝑌 ≠ ∅))
30	29	simprbi 497	. . . . . . . . . . 11 ⊢ (𝑌 ∈ (𝐴 ∖ 1o) → 𝑌 ≠ ∅)
31	25, 30	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ≠ ∅)
32		on0eln0 6375	. . . . . . . . . . 11 ⊢ (𝑌 ∈ On → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
33	28, 32	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → (∅ ∈ 𝑌 ↔ 𝑌 ≠ ∅))
34	31, 33	mpbird 257	. . . . . . . . 9 ⊢ (𝜑 → ∅ ∈ 𝑌)
35		omword1 8502	. . . . . . . . 9 ⊢ ((((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) ∧ ∅ ∈ 𝑌) → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
36	24, 28, 34, 35	syl21anc 838	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ↑o 𝑋) ⊆ ((𝐴 ↑o 𝑋) ·o 𝑌))
37		omcl 8465	. . . . . . . . . . 11 ⊢ (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑌 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
38	24, 28, 37	syl2anc 585	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On)
39	21	simp3d 1145	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑍 ∈ (𝐴 ↑o 𝑋))
40		onelon 6343	. . . . . . . . . . 11 ⊢ (((𝐴 ↑o 𝑋) ∈ On ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → 𝑍 ∈ On)
41	24, 39, 40	syl2anc 585	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ On)
42		oaword1 8481	. . . . . . . . . 10 ⊢ ((((𝐴 ↑o 𝑋) ·o 𝑌) ∈ On ∧ 𝑍 ∈ On) → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
43	38, 41, 42	syl2anc 585	. . . . . . . . 9 ⊢ (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
44	20	simprd 495	. . . . . . . . 9 ⊢ (𝜑 → (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍) = 𝐶)
45	43, 44	sseqtrd 3959	. . . . . . . 8 ⊢ (𝜑 → ((𝐴 ↑o 𝑋) ·o 𝑌) ⊆ 𝐶)
46	36, 45	sstrd 3933	. . . . . . 7 ⊢ (𝜑 → (𝐴 ↑o 𝑋) ⊆ 𝐶)
47		oecl 8466	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑o 𝐵) ∈ On)
48	2, 3, 47	syl2anc 585	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ↑o 𝐵) ∈ On)
49		ontr2 6366	. . . . . . . 8 ⊢ (((𝐴 ↑o 𝑋) ∈ On ∧ (𝐴 ↑o 𝐵) ∈ On) → (((𝐴 ↑o 𝑋) ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 ↑o 𝐵)) → (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
50	24, 48, 49	syl2anc 585	. . . . . . 7 ⊢ (𝜑 → (((𝐴 ↑o 𝑋) ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 ↑o 𝐵)) → (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
51	46, 6, 50	mp2and 700	. . . . . 6 ⊢ (𝜑 → (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵))
52	9	simpld 494	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ (On ∖ 2o))
53		oeord 8518	. . . . . . 7 ⊢ ((𝑋 ∈ On ∧ 𝐵 ∈ On ∧ 𝐴 ∈ (On ∖ 2o)) → (𝑋 ∈ 𝐵 ↔ (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
54	22, 3, 52, 53	syl3anc 1374	. . . . . 6 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ↔ (𝐴 ↑o 𝑋) ∈ (𝐴 ↑o 𝐵)))
55	51, 54	mpbird 257	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
56	2	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐴 ∈ On)
57	3	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐵 ∈ On)
58		suppssdm 8121	. . . . . . . . . . . . . . 15 ⊢ (𝐺 supp ∅) ⊆ dom 𝐺
59	1, 2, 3	cantnfs 9581	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (𝐺 ∈ 𝑆 ↔ (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅)))
60	4, 59	mpbid 232	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐺:𝐵⟶𝐴 ∧ 𝐺 finSupp ∅))
61	60	simpld 494	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
62	58, 61	fssdm 6682	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐺 supp ∅) ⊆ 𝐵)
63	62	sselda 3922	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑥 ∈ 𝐵)
64		onelon 6343	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ On ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ On)
65	57, 63, 64	syl2anc 585	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑥 ∈ On)
66		oecl 8466	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝑥 ∈ On) → (𝐴 ↑o 𝑥) ∈ On)
67	56, 65, 66	syl2anc 585	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ∈ On)
68	61	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐺:𝐵⟶𝐴)
69	68, 63	ffvelcdmd 7032	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐺‘𝑥) ∈ 𝐴)
70		onelon 6343	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ (𝐺‘𝑥) ∈ 𝐴) → (𝐺‘𝑥) ∈ On)
71	56, 69, 70	syl2anc 585	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐺‘𝑥) ∈ On)
72	61	ffnd 6664	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 Fn 𝐵)
73	8	elexd 3454	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∅ ∈ V)
74		elsuppfn 8114	. . . . . . . . . . . . . 14 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ On ∧ ∅ ∈ V) → (𝑥 ∈ (𝐺 supp ∅) ↔ (𝑥 ∈ 𝐵 ∧ (𝐺‘𝑥) ≠ ∅)))
75	72, 3, 73, 74	syl3anc 1374	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ (𝐺 supp ∅) ↔ (𝑥 ∈ 𝐵 ∧ (𝐺‘𝑥) ≠ ∅)))
76	75	simplbda 499	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐺‘𝑥) ≠ ∅)
77		on0eln0 6375	. . . . . . . . . . . . 13 ⊢ ((𝐺‘𝑥) ∈ On → (∅ ∈ (𝐺‘𝑥) ↔ (𝐺‘𝑥) ≠ ∅))
78	71, 77	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (∅ ∈ (𝐺‘𝑥) ↔ (𝐺‘𝑥) ≠ ∅))
79	76, 78	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ∅ ∈ (𝐺‘𝑥))
80		omword1 8502	. . . . . . . . . . 11 ⊢ ((((𝐴 ↑o 𝑥) ∈ On ∧ (𝐺‘𝑥) ∈ On) ∧ ∅ ∈ (𝐺‘𝑥)) → (𝐴 ↑o 𝑥) ⊆ ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)))
81	67, 71, 79, 80	syl21anc 838	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ⊆ ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)))
82		eqid 2737	. . . . . . . . . . . 12 ⊢ OrdIso( E , (𝐺 supp ∅)) = OrdIso( E , (𝐺 supp ∅))
83	4	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐺 ∈ 𝑆)
84		eqid 2737	. . . . . . . . . . . 12 ⊢ seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·o (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +o 𝑧)), ∅) = seqω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑o (OrdIso( E , (𝐺 supp ∅))‘𝑘)) ·o (𝐺‘(OrdIso( E , (𝐺 supp ∅))‘𝑘))) +o 𝑧)), ∅)
85	1, 56, 57, 82, 83, 84, 63	cantnfle 9586	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)) ⊆ ((𝐴 CNF 𝐵)‘𝐺))
86		cantnf.v	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐺) = 𝑍)
87	86	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ((𝐴 CNF 𝐵)‘𝐺) = 𝑍)
88	85, 87	sseqtrd 3959	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → ((𝐴 ↑o 𝑥) ·o (𝐺‘𝑥)) ⊆ 𝑍)
89	81, 88	sstrd 3933	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ⊆ 𝑍)
90	39	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑍 ∈ (𝐴 ↑o 𝑋))
91	24	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑋) ∈ On)
92		ontr2 6366	. . . . . . . . . 10 ⊢ (((𝐴 ↑o 𝑥) ∈ On ∧ (𝐴 ↑o 𝑋) ∈ On) → (((𝐴 ↑o 𝑥) ⊆ 𝑍 ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
93	67, 91, 92	syl2anc 585	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (((𝐴 ↑o 𝑥) ⊆ 𝑍 ∧ 𝑍 ∈ (𝐴 ↑o 𝑋)) → (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
94	89, 90, 93	mp2and 700	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋))
95	22	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑋 ∈ On)
96	52	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝐴 ∈ (On ∖ 2o))
97		oeord 8518	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑋 ∈ On ∧ 𝐴 ∈ (On ∖ 2o)) → (𝑥 ∈ 𝑋 ↔ (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
98	65, 95, 96, 97	syl3anc 1374	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → (𝑥 ∈ 𝑋 ↔ (𝐴 ↑o 𝑥) ∈ (𝐴 ↑o 𝑋)))
99	94, 98	mpbird 257	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐺 supp ∅)) → 𝑥 ∈ 𝑋)
100	99	ex 412	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ (𝐺 supp ∅) → 𝑥 ∈ 𝑋))
101	100	ssrdv 3928	. . . . 5 ⊢ (𝜑 → (𝐺 supp ∅) ⊆ 𝑋)
102		cantnf.f	. . . . 5 ⊢ 𝐹 = (𝑡 ∈ 𝐵 ↦ if(𝑡 = 𝑋, 𝑌, (𝐺‘𝑡)))
103	1, 2, 3, 4, 55, 26, 101, 102	cantnfp1 9596	. . . 4 ⊢ (𝜑 → (𝐹 ∈ 𝑆 ∧ ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑o 𝑋) ·o 𝑌) +o ((𝐴 CNF 𝐵)‘𝐺))))
104	103	simprd 495	. . 3 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = (((𝐴 ↑o 𝑋) ·o 𝑌) +o ((𝐴 CNF 𝐵)‘𝐺)))
105	86	oveq2d 7377	. . 3 ⊢ (𝜑 → (((𝐴 ↑o 𝑋) ·o 𝑌) +o ((𝐴 CNF 𝐵)‘𝐺)) = (((𝐴 ↑o 𝑋) ·o 𝑌) +o 𝑍))
106	104, 105, 44	3eqtrd 2776	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = 𝐶)
107	1, 2, 3	cantnff 9589	. . . 4 ⊢ (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑o 𝐵))
108	107	ffnd 6664	. . 3 ⊢ (𝜑 → (𝐴 CNF 𝐵) Fn 𝑆)
109	103	simpld 494	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
110		fnfvelrn 7027	. . 3 ⊢ (((𝐴 CNF 𝐵) Fn 𝑆 ∧ 𝐹 ∈ 𝑆) → ((𝐴 CNF 𝐵)‘𝐹) ∈ ran (𝐴 CNF 𝐵))
111	108, 109, 110	syl2anc 585	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) ∈ ran (𝐴 CNF 𝐵))
112	106, 111	eqeltrrd 2838	1 ⊢ (𝜑 → 𝐶 ∈ ran (𝐴 CNF 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3390  Vcvv 3430   ∖ cdif 3887   ⊆ wss 3890  ∅c0 4274  ifcif 4467  ⟨cop 4574  ∪ cuni 4851  ∩ cint 4890   class class class wbr 5086  {copab 5148   ↦ cmpt 5167   E cep 5524  dom cdm 5625  ran crn 5626  Oncon0 6318  ℩cio 6447   Fn wfn 6488  ⟶wf 6489  ‘cfv 6493  (class class class)co 7361   ∈ cmpo 7363  1^st c1st 7934  2^nd c2nd 7935   supp csupp 8104  seq_ωcseqom 8380  1_oc1o 8392  2_oc2o 8393   +_o coa 8396   ·_o comu 8397   ↑_o coe 8398   finSupp cfsupp 9268  OrdIsocoi 9418   CNF ccnf 9576

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-se 5579  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-isom 6502  df-riota 7318  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-1st 7936  df-2nd 7937  df-supp 8105  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-seqom 8381  df-1o 8399  df-2o 8400  df-oadd 8403  df-omul 8404  df-oexp 8405  df-er 8637  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-fsupp 9269  df-oi 9419  df-cnf 9577

This theorem is referenced by:  cantnflem4  9607