cantnf - Metamath Proof Explorer

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

Theorem cantnf 9694

Description: The Cantor Normal Form theorem. The function (𝐴 CNF 𝐵), which maps a finitely supported function from 𝐵 to 𝐴 to the sum ((𝐴 ↑_o 𝑓(𝑎1)) ∘ 𝑎1) +_o ((𝐴 ↑_o 𝑓(𝑎2)) ∘ 𝑎2) +_o ... over all indices 𝑎 < 𝐵 such that 𝑓(𝑎) is nonzero, is an order isomorphism from the ordering 𝑇 of finitely supported functions to the set (𝐴 ↑_o 𝐵) under the natural order. Setting 𝐴 = ω and letting 𝐵 be arbitrarily large, the surjectivity of this function implies that every ordinal has a Cantor normal form (and injectivity, together with coherence cantnfres 9678, implies that such a representation is unique). (Contributed by Mario Carneiro, 28-May-2015.)

**Hypotheses**
Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
oemapval.t	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}

**Assertion**
Ref	Expression
cantnf	⊢ (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑_o 𝐵)))

Distinct variable groups: 𝑥,𝑤,𝑦,𝑧,𝐵 𝑤,𝐴,𝑥,𝑦,𝑧 𝑥,𝑆,𝑦,𝑧 𝜑,𝑥,𝑦,𝑧 Allowed substitution hints: 𝜑(𝑤) 𝑆(𝑤) 𝑇(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem cantnf Dummy variables 𝑓 𝑐 𝑔 𝑘 𝑡 𝑢 𝑣 𝑎 𝑏 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cantnfs.s	. . 3 ⊢ 𝑆 = dom (𝐴 CNF 𝐵)
2		cantnfs.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ On)
3		cantnfs.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ On)
4		oemapval.t	. . 3 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
5	1, 2, 3, 4	oemapso 9683	. 2 ⊢ (𝜑 → 𝑇 Or 𝑆)
6		oecl 8545	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ↑_o 𝐵) ∈ On)
7	2, 3, 6	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝐴 ↑_o 𝐵) ∈ On)
8		eloni 6372	. . . 4 ⊢ ((𝐴 ↑_o 𝐵) ∈ On → Ord (𝐴 ↑_o 𝐵))
9	7, 8	syl 18	. . 3 ⊢ (𝜑 → Ord (𝐴 ↑_o 𝐵))
10		ordwe 6375	. . 3 ⊢ (Ord (𝐴 ↑_o 𝐵) → E We (𝐴 ↑_o 𝐵))
11		weso 5642	. . 3 ⊢ ( E We (𝐴 ↑_o 𝐵) → E Or (𝐴 ↑_o 𝐵))
12		sopo 5578	. . 3 ⊢ ( E Or (𝐴 ↑_o 𝐵) → E Po (𝐴 ↑_o 𝐵))
13	9, 10, 11, 12	4syl 20	. 2 ⊢ (𝜑 → E Po (𝐴 ↑_o 𝐵))
14	1, 2, 3	cantnff 9675	. . 3 ⊢ (𝜑 → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑_o 𝐵))
15	14	frnd 6718	. . . 4 ⊢ (𝜑 → ran (𝐴 CNF 𝐵) ⊆ (𝐴 ↑_o 𝐵))
16		onss 7799	. . . . . . . 8 ⊢ ((𝐴 ↑_o 𝐵) ∈ On → (𝐴 ↑_o 𝐵) ⊆ On)
17	7, 16	syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐴 ↑_o 𝐵) ⊆ On)
18	17	sseld 3930	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ On))
19		eleq1w 2844	. . . . . . . . . 10 ⊢ (𝑡 = 𝑦 → (𝑡 ∈ (𝐴 ↑_o 𝐵) ↔ 𝑦 ∈ (𝐴 ↑_o 𝐵)))
20		eleq1w 2844	. . . . . . . . . 10 ⊢ (𝑡 = 𝑦 → (𝑡 ∈ ran (𝐴 CNF 𝐵) ↔ 𝑦 ∈ ran (𝐴 CNF 𝐵)))
21	19, 20	imbi12d 347	. . . . . . . . 9 ⊢ (𝑡 = 𝑦 → ((𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵)) ↔ (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵))))
22	21	imbi2d 343	. . . . . . . 8 ⊢ (𝑡 = 𝑦 → ((𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵))) ↔ (𝜑 → (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)))))
23		r19.21v 3188	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝑡 (𝜑 → (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵))) ↔ (𝜑 → ∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵))))
24		ordelss 6378	. . . . . . . . . . . . . . . . . . 19 ⊢ ((Ord (𝐴 ↑_o 𝐵) ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → 𝑡 ⊆ (𝐴 ↑_o 𝐵))
25	9, 24	sylan 592	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → 𝑡 ⊆ (𝐴 ↑_o 𝐵))
26	25	sselda 3931	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) ∧ 𝑦 ∈ 𝑡) → 𝑦 ∈ (𝐴 ↑_o 𝐵))
27		pm5.5 364	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (𝐴 ↑_o 𝐵) → ((𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) ↔ 𝑦 ∈ ran (𝐴 CNF 𝐵)))
28	26, 27	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) ∧ 𝑦 ∈ 𝑡) → ((𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) ↔ 𝑦 ∈ ran (𝐴 CNF 𝐵)))
29	28	ralbidva 3184	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → (∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) ↔ ∀𝑦 ∈ 𝑡 𝑦 ∈ ran (𝐴 CNF 𝐵)))
30		dfss3 3920	. . . . . . . . . . . . . . 15 ⊢ (𝑡 ⊆ ran (𝐴 CNF 𝐵) ↔ ∀𝑦 ∈ 𝑡 𝑦 ∈ ran (𝐴 CNF 𝐵))
31	29, 30	bitr4di 292	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → (∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) ↔ 𝑡 ⊆ ran (𝐴 CNF 𝐵)))
32		eleq1 2849	. . . . . . . . . . . . . . . 16 ⊢ (𝑡 = ∅ → (𝑡 ∈ ran (𝐴 CNF 𝐵) ↔ ∅ ∈ ran (𝐴 CNF 𝐵)))
33	2	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → 𝐴 ∈ On)
34	33	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑡 ≠ ∅) → 𝐴 ∈ On)
35	3	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → 𝐵 ∈ On)
36	35	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑡 ≠ ∅) → 𝐵 ∈ On)
37		simplrl 789	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑡 ≠ ∅) → 𝑡 ∈ (𝐴 ↑_o 𝐵))
38		simplrr 790	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑡 ≠ ∅) → 𝑡 ⊆ ran (𝐴 CNF 𝐵))
39	7	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐴 ↑_o 𝐵) ∈ On)
40		simprl 783	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → 𝑡 ∈ (𝐴 ↑_o 𝐵))
41		onelon 6387	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐴 ↑_o 𝐵) ∈ On ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → 𝑡 ∈ On)
42	39, 40, 41	syl2anc 596	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → 𝑡 ∈ On)
43		on0eln0 6420	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑡 ∈ On → (∅ ∈ 𝑡 ↔ 𝑡 ≠ ∅))
44	42, 43	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (∅ ∈ 𝑡 ↔ 𝑡 ≠ ∅))
45	44	biimpar 483	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑡 ≠ ∅) → ∅ ∈ 𝑡)
46		eqid 2761	. . . . . . . . . . . . . . . . 17 ⊢ ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)} = ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}
47		eqid 2761	. . . . . . . . . . . . . . . . 17 ⊢ (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)})(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}) ·_o 𝑎) +_o 𝑏) = 𝑡)) = (℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)})(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}) ·_o 𝑎) +_o 𝑏) = 𝑡))
48		eqid 2761	. . . . . . . . . . . . . . . . 17 ⊢ (1^st ‘(℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)})(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}) ·_o 𝑎) +_o 𝑏) = 𝑡))) = (1^st ‘(℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)})(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}) ·_o 𝑎) +_o 𝑏) = 𝑡)))
49		eqid 2761	. . . . . . . . . . . . . . . . 17 ⊢ (2^nd ‘(℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)})(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}) ·_o 𝑎) +_o 𝑏) = 𝑡))) = (2^nd ‘(℩𝑑∃𝑎 ∈ On ∃𝑏 ∈ (𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)})(𝑑 = ⟨𝑎, 𝑏⟩ ∧ (((𝐴 ↑_o ∪ ∩ {𝑐 ∈ On ∣ 𝑡 ∈ (𝐴 ↑_o 𝑐)}) ·_o 𝑎) +_o 𝑏) = 𝑡)))
50	1, 34, 36, 4, 37, 38, 45, 46, 47, 48, 49	cantnflem4 9693	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑡 ≠ ∅) → 𝑡 ∈ ran (𝐴 CNF 𝐵))
51		fczsupp0 8210	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐵 × {∅}) supp ∅) = ∅
52	51	eqcomi 2770	. . . . . . . . . . . . . . . . . . . 20 ⊢ ∅ = ((𝐵 × {∅}) supp ∅)
53		oieq2 9507	. . . . . . . . . . . . . . . . . . . 20 ⊢ (∅ = ((𝐵 × {∅}) supp ∅) → OrdIso( E , ∅) = OrdIso( E , ((𝐵 × {∅}) supp ∅)))
54	52, 53	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ OrdIso( E , ∅) = OrdIso( E , ((𝐵 × {∅}) supp ∅))
55		ne0i 4287	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑡 ∈ (𝐴 ↑_o 𝐵) → (𝐴 ↑_o 𝐵) ≠ ∅)
56	55	ad2antrl 741	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐴 ↑_o 𝐵) ≠ ∅)
57		oveq1 7427	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐴 = ∅ → (𝐴 ↑_o 𝐵) = (∅ ↑_o 𝐵))
58	57	neeq1d 3015	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐴 = ∅ → ((𝐴 ↑_o 𝐵) ≠ ∅ ↔ (∅ ↑_o 𝐵) ≠ ∅))
59	56, 58	syl5ibcom 248	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐴 = ∅ → (∅ ↑_o 𝐵) ≠ ∅))
60	59	necon2d 2979	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → ((∅ ↑_o 𝐵) = ∅ → 𝐴 ≠ ∅))
61		on0eln0 6420	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ 𝐵 ≠ ∅))
62		oe0m1 8529	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐵 ∈ On → (∅ ∈ 𝐵 ↔ (∅ ↑_o 𝐵) = ∅))
63	61, 62	bitr3d 284	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐵 ∈ On → (𝐵 ≠ ∅ ↔ (∅ ↑_o 𝐵) = ∅))
64	35, 63	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐵 ≠ ∅ ↔ (∅ ↑_o 𝐵) = ∅))
65		on0eln0 6420	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐴 ∈ On → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
66	33, 65	syl 18	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (∅ ∈ 𝐴 ↔ 𝐴 ≠ ∅))
67	60, 64, 66	3imtr4d 297	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐵 ≠ ∅ → ∅ ∈ 𝐴))
68		ne0i 4287	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 ∈ 𝐵 → 𝐵 ≠ ∅)
69	67, 68	impel 515	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) ∧ 𝑦 ∈ 𝐵) → ∅ ∈ 𝐴)
70		fconstmpt 5713	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝐵 × {∅}) = (𝑦 ∈ 𝐵 ↦ ∅)
71	69, 70	fmptd 7114	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐵 × {∅}):𝐵⟶𝐴)
72		0ex 5261	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ∅ ∈ V
73	72	a1i 11	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → ∅ ∈ V)
74	3, 73	fczfsuppd 9378	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → (𝐵 × {∅}) finSupp ∅)
75	74	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐵 × {∅}) finSupp ∅)
76	1, 2, 3	cantnfs 9667	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → ((𝐵 × {∅}) ∈ 𝑆 ↔ ((𝐵 × {∅}):𝐵⟶𝐴 ∧ (𝐵 × {∅}) finSupp ∅)))
77	76	adantr 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → ((𝐵 × {∅}) ∈ 𝑆 ↔ ((𝐵 × {∅}):𝐵⟶𝐴 ∧ (𝐵 × {∅}) finSupp ∅)))
78	71, 75, 77	mpbir2and 726	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐵 × {∅}) ∈ 𝑆)
79		eqid 2761	. . . . . . . . . . . . . . . . . . 19 ⊢ seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)
80	1, 33, 35, 54, 78, 79	cantnfval 9669	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → ((𝐴 CNF 𝐵)‘(𝐵 × {∅})) = (seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ∅)))
81		we0 5646	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ E We ∅
82		eqid 2761	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ OrdIso( E , ∅) = OrdIso( E , ∅)
83	82	oien 9532	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((∅ ∈ V ∧ E We ∅) → dom OrdIso( E , ∅) ≈ ∅)
84	72, 81, 83	mp2an 705	. . . . . . . . . . . . . . . . . . . . 21 ⊢ dom OrdIso( E , ∅) ≈ ∅
85		en0 9045	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (dom OrdIso( E , ∅) ≈ ∅ ↔ dom OrdIso( E , ∅) = ∅)
86	84, 85	mpbi 233	. . . . . . . . . . . . . . . . . . . 20 ⊢ dom OrdIso( E , ∅) = ∅
87	86	fveq2i 6888	. . . . . . . . . . . . . . . . . . 19 ⊢ (seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ∅)) = (seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)‘∅)
88	79	seqom0g 8466	. . . . . . . . . . . . . . . . . . . 20 ⊢ (∅ ∈ V → (seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)‘∅) = ∅)
89	72, 88	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)‘∅) = ∅
90	87, 89	eqtri 2784	. . . . . . . . . . . . . . . . . 18 ⊢ (seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ∅)‘𝑘)) ·_o ((𝐵 × {∅})‘(OrdIso( E , ∅)‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ∅)) = ∅
91	80, 90	eqtrdi 2812	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → ((𝐴 CNF 𝐵)‘(𝐵 × {∅})) = ∅)
92	14	adantr 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑_o 𝐵))
93	92	ffnd 6710	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → (𝐴 CNF 𝐵) Fn 𝑆)
94		fnfvelrn 7080	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐴 CNF 𝐵) Fn 𝑆 ∧ (𝐵 × {∅}) ∈ 𝑆) → ((𝐴 CNF 𝐵)‘(𝐵 × {∅})) ∈ ran (𝐴 CNF 𝐵))
95	93, 78, 94	syl2anc 596	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → ((𝐴 CNF 𝐵)‘(𝐵 × {∅})) ∈ ran (𝐴 CNF 𝐵))
96	91, 95	eqeltrrd 2862	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → ∅ ∈ ran (𝐴 CNF 𝐵))
97	32, 50, 96	pm2.61ne 3041	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑡 ∈ (𝐴 ↑_o 𝐵) ∧ 𝑡 ⊆ ran (𝐴 CNF 𝐵))) → 𝑡 ∈ ran (𝐴 CNF 𝐵))
98	97	expr 462	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → (𝑡 ⊆ ran (𝐴 CNF 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵)))
99	31, 98	sylbid 243	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝐴 ↑_o 𝐵)) → (∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) → 𝑡 ∈ ran (𝐴 CNF 𝐵)))
100	99	ex 418	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → (∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) → 𝑡 ∈ ran (𝐴 CNF 𝐵))))
101	100	com23 87	. . . . . . . . . . 11 ⊢ (𝜑 → (∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵)) → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵))))
102	101	a2i 15	. . . . . . . . . 10 ⊢ ((𝜑 → ∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵))) → (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵))))
103	102	a1i 11	. . . . . . . . 9 ⊢ (𝑡 ∈ On → ((𝜑 → ∀𝑦 ∈ 𝑡 (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵))) → (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵)))))
104	23, 103	biimtrid 245	. . . . . . . 8 ⊢ (𝑡 ∈ On → (∀𝑦 ∈ 𝑡 (𝜑 → (𝑦 ∈ (𝐴 ↑_o 𝐵) → 𝑦 ∈ ran (𝐴 CNF 𝐵))) → (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵)))))
105	22, 104	tfis2 7868	. . . . . . 7 ⊢ (𝑡 ∈ On → (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵))))
106	105	com3l 90	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → (𝑡 ∈ On → 𝑡 ∈ ran (𝐴 CNF 𝐵))))
107	18, 106	mpdd 44	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ (𝐴 ↑_o 𝐵) → 𝑡 ∈ ran (𝐴 CNF 𝐵)))
108	107	ssrdv 3937	. . . 4 ⊢ (𝜑 → (𝐴 ↑_o 𝐵) ⊆ ran (𝐴 CNF 𝐵))
109	15, 108	eqssd 3948	. . 3 ⊢ (𝜑 → ran (𝐴 CNF 𝐵) = (𝐴 ↑_o 𝐵))
110		dffo2 6800	. . 3 ⊢ ((𝐴 CNF 𝐵):𝑆–onto→(𝐴 ↑_o 𝐵) ↔ ((𝐴 CNF 𝐵):𝑆⟶(𝐴 ↑_o 𝐵) ∧ ran (𝐴 CNF 𝐵) = (𝐴 ↑_o 𝐵)))
111	14, 109, 110	sylanbrc 595	. 2 ⊢ (𝜑 → (𝐴 CNF 𝐵):𝑆–onto→(𝐴 ↑_o 𝐵))
112	2	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → 𝐴 ∈ On)
113	3	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → 𝐵 ∈ On)
114		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑡 → (𝑥‘𝑧) = (𝑥‘𝑡))
115		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑡 → (𝑦‘𝑧) = (𝑦‘𝑡))
116	114, 115	eleq12d 2855	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑡 → ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ↔ (𝑥‘𝑡) ∈ (𝑦‘𝑡)))
117		eleq1w 2844	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑡 → (𝑧 ∈ 𝑤 ↔ 𝑡 ∈ 𝑤))
118	117	imbi1d 344	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑡 → ((𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))
119	118	ralbidv 3186	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑡 → (∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))
120	116, 119	anbi12d 644	. . . . . . . . . 10 ⊢ (𝑧 = 𝑡 → (((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝑥‘𝑡) ∈ (𝑦‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))))
121	120	cbvrexvw 3242	. . . . . . . . 9 ⊢ (∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑡 ∈ 𝐵 ((𝑥‘𝑡) ∈ (𝑦‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))))
122		fveq1 6884	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑢 → (𝑥‘𝑡) = (𝑢‘𝑡))
123		fveq1 6884	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑣 → (𝑦‘𝑡) = (𝑣‘𝑡))
124		eleq12 2851	. . . . . . . . . . . 12 ⊢ (((𝑥‘𝑡) = (𝑢‘𝑡) ∧ (𝑦‘𝑡) = (𝑣‘𝑡)) → ((𝑥‘𝑡) ∈ (𝑦‘𝑡) ↔ (𝑢‘𝑡) ∈ (𝑣‘𝑡)))
125	122, 123, 124	syl2an 608	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → ((𝑥‘𝑡) ∈ (𝑦‘𝑡) ↔ (𝑢‘𝑡) ∈ (𝑣‘𝑡)))
126		fveq1 6884	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑢 → (𝑥‘𝑤) = (𝑢‘𝑤))
127		fveq1 6884	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑣 → (𝑦‘𝑤) = (𝑣‘𝑤))
128	126, 127	eqeqan12d 2775	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → ((𝑥‘𝑤) = (𝑦‘𝑤) ↔ (𝑢‘𝑤) = (𝑣‘𝑤)))
129	128	imbi2d 343	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → ((𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤))))
130	129	ralbidv 3186	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → (∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤))))
131	125, 130	anbi12d 644	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → (((𝑥‘𝑡) ∈ (𝑦‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝑢‘𝑡) ∈ (𝑣‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤)))))
132	131	rexbidv 3187	. . . . . . . . 9 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → (∃𝑡 ∈ 𝐵 ((𝑥‘𝑡) ∈ (𝑦‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑡 ∈ 𝐵 ((𝑢‘𝑡) ∈ (𝑣‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤)))))
133	121, 132	bitrid 286	. . . . . . . 8 ⊢ ((𝑥 = 𝑢 ∧ 𝑦 = 𝑣) → (∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑡 ∈ 𝐵 ((𝑢‘𝑡) ∈ (𝑣‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤)))))
134	133	cbvopabv 5178	. . . . . . 7 ⊢ {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐵 ((𝑥‘𝑧) ∈ (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐵 (𝑧 ∈ 𝑤 → (𝑥‘𝑤) = (𝑦‘𝑤)))} = {⟨𝑢, 𝑣⟩ ∣ ∃𝑡 ∈ 𝐵 ((𝑢‘𝑡) ∈ (𝑣‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤)))}
135	4, 134	eqtri 2784	. . . . . 6 ⊢ 𝑇 = {⟨𝑢, 𝑣⟩ ∣ ∃𝑡 ∈ 𝐵 ((𝑢‘𝑡) ∈ (𝑣‘𝑡) ∧ ∀𝑤 ∈ 𝐵 (𝑡 ∈ 𝑤 → (𝑢‘𝑤) = (𝑣‘𝑤)))}
136		simprll 791	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → 𝑓 ∈ 𝑆)
137		simprlr 792	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → 𝑔 ∈ 𝑆)
138		simprr 785	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → 𝑓𝑇𝑔)
139		eqid 2761	. . . . . 6 ⊢ ∪ {𝑐 ∈ 𝐵 ∣ (𝑓‘𝑐) ∈ (𝑔‘𝑐)} = ∪ {𝑐 ∈ 𝐵 ∣ (𝑓‘𝑐) ∈ (𝑔‘𝑐)}
140		eqid 2761	. . . . . 6 ⊢ OrdIso( E , (𝑔 supp ∅)) = OrdIso( E , (𝑔 supp ∅))
141		eqid 2761	. . . . . 6 ⊢ seq_ω((𝑘 ∈ V, 𝑡 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , (𝑔 supp ∅))‘𝑘)) ·_o (𝑔‘(OrdIso( E , (𝑔 supp ∅))‘𝑘))) +_o 𝑡)), ∅) = seq_ω((𝑘 ∈ V, 𝑡 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , (𝑔 supp ∅))‘𝑘)) ·_o (𝑔‘(OrdIso( E , (𝑔 supp ∅))‘𝑘))) +_o 𝑡)), ∅)
142	1, 112, 113, 135, 136, 137, 138, 139, 140, 141	cantnflem1 9690	. . . . 5 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → ((𝐴 CNF 𝐵)‘𝑓) ∈ ((𝐴 CNF 𝐵)‘𝑔))
143		fvex 6898	. . . . . 6 ⊢ ((𝐴 CNF 𝐵)‘𝑔) ∈ V
144	143	epeli 5553	. . . . 5 ⊢ (((𝐴 CNF 𝐵)‘𝑓) E ((𝐴 CNF 𝐵)‘𝑔) ↔ ((𝐴 CNF 𝐵)‘𝑓) ∈ ((𝐴 CNF 𝐵)‘𝑔))
145	142, 144	sylibr 237	. . . 4 ⊢ ((𝜑 ∧ ((𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆) ∧ 𝑓𝑇𝑔)) → ((𝐴 CNF 𝐵)‘𝑓) E ((𝐴 CNF 𝐵)‘𝑔))
146	145	expr 462	. . 3 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝑆 ∧ 𝑔 ∈ 𝑆)) → (𝑓𝑇𝑔 → ((𝐴 CNF 𝐵)‘𝑓) E ((𝐴 CNF 𝐵)‘𝑔)))
147	146	ralrimivva 3206	. 2 ⊢ (𝜑 → ∀𝑓 ∈ 𝑆 ∀𝑔 ∈ 𝑆 (𝑓𝑇𝑔 → ((𝐴 CNF 𝐵)‘𝑓) E ((𝐴 CNF 𝐵)‘𝑔)))
148		soisoi 7336	. 2 ⊢ (((𝑇 Or 𝑆 ∧ E Po (𝐴 ↑_o 𝐵)) ∧ ((𝐴 CNF 𝐵):𝑆–onto→(𝐴 ↑_o 𝐵) ∧ ∀𝑓 ∈ 𝑆 ∀𝑔 ∈ 𝑆 (𝑓𝑇𝑔 → ((𝐴 CNF 𝐵)‘𝑓) E ((𝐴 CNF 𝐵)‘𝑔)))) → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑_o 𝐵)))
149	5, 13, 111, 147, 148	syl22anc 852	1 ⊢ (𝜑 → (𝐴 CNF 𝐵) Isom 𝑇, E (𝑆, (𝐴 ↑_o 𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 ∃wrex 3087 {crab 3413 Vcvv 3451 ⊆ wss 3899 ∅c0 4279 {csn 4584 ⟨cop 4590 ∪ cuni 4867 ∩ cint 4907 class class class wbr 5103 {copab 5167 E cep 5550 Po wpo 5557 Or wor 5558 We wwe 5603 × cxp 5649 dom cdm 5651 ran crn 5652 Ord word 6361 Oncon0 6362 ℩cio 6492 Fn wfn 6533 ⟶wf 6534 –onto→wfo 6536 ‘cfv 6538 Isom wiso 6539 (class class class)co 7420 ∈ cmpo 7422 1^st c1st 7999 2^nd c2nd 8000 supp csupp 8177 seq_ωcseqom 8457 +_o coa 8473 ·_o comu 8474 ↑_o coe 8475 ≈ cen 8970 finSupp cfsupp 9353 OrdIsocoi 9503 CNF ccnf 9662

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-supp 8178 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-seqom 8458 df-1o 8476 df-2o 8477 df-oadd 8480 df-omul 8481 df-oexp 8482 df-er 8717 df-map 8849 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-fsupp 9354 df-oi 9504 df-cnf 9663

This theorem is used by: oemapwe 9695 cantnffval2 9696 cantnff1o 9697 cantnfresb 44325

W3C validator