cantnfres - Metamath Proof Explorer

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

Theorem cantnfres 9674

Description: The CNF function respects extensions of the domain to a larger ordinal. (Contributed by Mario Carneiro, 25-May-2015.)

**Hypotheses**
Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
cantnfrescl.d	⊢ (𝜑 → 𝐷 ∈ On)
cantnfrescl.b	⊢ (𝜑 → 𝐵 ⊆ 𝐷)
cantnfrescl.x	⊢ ((𝜑 ∧ 𝑛 ∈ (𝐷 ∖ 𝐵)) → 𝑋 = ∅)
cantnfrescl.a	⊢ (𝜑 → ∅ ∈ 𝐴)
cantnfrescl.t	⊢ 𝑇 = dom (𝐴 CNF 𝐷)
cantnfres.m	⊢ (𝜑 → (𝑛 ∈ 𝐵 ↦ 𝑋) ∈ 𝑆)

**Assertion**
Ref	Expression
cantnfres	⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑛 ∈ 𝐵 ↦ 𝑋)) = ((𝐴 CNF 𝐷)‘(𝑛 ∈ 𝐷 ↦ 𝑋)))

Distinct variable groups: 𝐵,𝑛 𝐷,𝑛 𝐴,𝑛 𝜑,𝑛 Allowed substitution hints: 𝑆(𝑛) 𝑇(𝑛) 𝑋(𝑛)

Proof of Theorem cantnfres Dummy variables 𝑘 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cantnfrescl.d	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 ∈ On)
2		cantnfrescl.b	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 ⊆ 𝐷)
3		cantnfrescl.x	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (𝐷 ∖ 𝐵)) → 𝑋 = ∅)
4	1, 2, 3	extmptsuppeq 8175	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅) = ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))
5		oieq2 9510	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅) = ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅) → OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) = OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)))
6	4, 5	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) = OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)))
7	6	fveq1d 6893	. . . . . . . . . 10 ⊢ (𝜑 → (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘) = (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))
8	7	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘) = (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))
9	8	oveq2d 7427	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) = (𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)))
10		suppssdm 8164	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅) ⊆ dom (𝑛 ∈ 𝐵 ↦ 𝑋)
11		eqid 2732	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ 𝐵 ↦ 𝑋) = (𝑛 ∈ 𝐵 ↦ 𝑋)
12	11	dmmptss 6240	. . . . . . . . . . . . . 14 ⊢ dom (𝑛 ∈ 𝐵 ↦ 𝑋) ⊆ 𝐵
13	12	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → dom (𝑛 ∈ 𝐵 ↦ 𝑋) ⊆ 𝐵)
14	10, 13	sstrid 3993	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅) ⊆ 𝐵)
15	14	3ad2ant1 1133	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅) ⊆ 𝐵)
16		eqid 2732	. . . . . . . . . . . . . 14 ⊢ OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) = OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))
17	16	oif 9527	. . . . . . . . . . . . 13 ⊢ OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)):dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))⟶((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)
18	17	ffvelcdmi 7085	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) → (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘) ∈ ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))
19	18	3ad2ant2 1134	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘) ∈ ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))
20	15, 19	sseldd 3983	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘) ∈ 𝐵)
21	20	fvresd 6911	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (((𝑛 ∈ 𝐷 ↦ 𝑋) ↾ 𝐵)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) = ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)))
22	2	3ad2ant1 1133	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → 𝐵 ⊆ 𝐷)
23	22	resmptd 6040	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → ((𝑛 ∈ 𝐷 ↦ 𝑋) ↾ 𝐵) = (𝑛 ∈ 𝐵 ↦ 𝑋))
24	23	fveq1d 6893	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (((𝑛 ∈ 𝐷 ↦ 𝑋) ↾ 𝐵)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) = ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)))
25	8	fveq2d 6895	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) = ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)))
26	21, 24, 25	3eqtr3d 2780	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) = ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)))
27	9, 26	oveq12d 7429	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → ((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) = ((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))))
28	27	oveq1d 7426	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) ∧ 𝑧 ∈ On) → (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧) = (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧))
29	28	mpoeq3dva 7488	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)) = (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)))
30	6	dmeqd 5905	. . . . . 6 ⊢ (𝜑 → dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) = dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)))
31		eqid 2732	. . . . . 6 ⊢ On = On
32		mpoeq12 7484	. . . . . 6 ⊢ ((dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)) = dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)) ∧ On = On) → (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)) = (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)))
33	30, 31, 32	sylancl 586	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)) = (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)))
34	29, 33	eqtrd 2772	. . . 4 ⊢ (𝜑 → (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)) = (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)))
35		eqid 2732	. . . 4 ⊢ ∅ = ∅
36		seqomeq12 8456	. . . 4 ⊢ (((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)) = (𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)) ∧ ∅ = ∅) → seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅))
37	34, 35, 36	sylancl 586	. . 3 ⊢ (𝜑 → seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅))
38	37, 30	fveq12d 6898	. 2 ⊢ (𝜑 → (seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))) = (seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))))
39		cantnfs.s	. . 3 ⊢ 𝑆 = dom (𝐴 CNF 𝐵)
40		cantnfs.a	. . 3 ⊢ (𝜑 → 𝐴 ∈ On)
41		cantnfs.b	. . 3 ⊢ (𝜑 → 𝐵 ∈ On)
42		cantnfres.m	. . 3 ⊢ (𝜑 → (𝑛 ∈ 𝐵 ↦ 𝑋) ∈ 𝑆)
43		eqid 2732	. . 3 ⊢ seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅)
44	39, 40, 41, 16, 42, 43	cantnfval2 9666	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑛 ∈ 𝐵 ↦ 𝑋)) = (seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐵 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ((𝑛 ∈ 𝐵 ↦ 𝑋) supp ∅))))
45		cantnfrescl.t	. . 3 ⊢ 𝑇 = dom (𝐴 CNF 𝐷)
46		eqid 2732	. . 3 ⊢ OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)) = OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))
47		cantnfrescl.a	. . . . 5 ⊢ (𝜑 → ∅ ∈ 𝐴)
48	39, 40, 41, 1, 2, 3, 47, 45	cantnfrescl 9673	. . . 4 ⊢ (𝜑 → ((𝑛 ∈ 𝐵 ↦ 𝑋) ∈ 𝑆 ↔ (𝑛 ∈ 𝐷 ↦ 𝑋) ∈ 𝑇))
49	42, 48	mpbid 231	. . 3 ⊢ (𝜑 → (𝑛 ∈ 𝐷 ↦ 𝑋) ∈ 𝑇)
50		eqid 2732	. . 3 ⊢ seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅) = seq_ω((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅)
51	45, 40, 1, 46, 49, 50	cantnfval2 9666	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐷)‘(𝑛 ∈ 𝐷 ↦ 𝑋)) = (seq_ω((𝑘 ∈ dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅)), 𝑧 ∈ On ↦ (((𝐴 ↑_o (OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘)) ·_o ((𝑛 ∈ 𝐷 ↦ 𝑋)‘(OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))‘𝑘))) +_o 𝑧)), ∅)‘dom OrdIso( E , ((𝑛 ∈ 𝐷 ↦ 𝑋) supp ∅))))
52	38, 44, 51	3eqtr4d 2782	1 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘(𝑛 ∈ 𝐵 ↦ 𝑋)) = ((𝐴 CNF 𝐷)‘(𝑛 ∈ 𝐷 ↦ 𝑋)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∖ cdif 3945 ⊆ wss 3948 ∅c0 4322 ↦ cmpt 5231 E cep 5579 dom cdm 5676 ↾ cres 5678 Oncon0 6364 ‘cfv 6543 (class class class)co 7411 ∈ cmpo 7413 supp csupp 8148 seq_ωcseqom 8449 +_o coa 8465 ·_o comu 8466 ↑_o coe 8467 OrdIsocoi 9506 CNF ccnf 9658

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 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727

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 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-supp 8149 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-seqom 8450 df-1o 8468 df-oadd 8472 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9364 df-oi 9507 df-cnf 9659

This theorem is referenced by: cantnf2 42157

W3C validator