Theorem cantnfval 8448

Description: The value of the Cantor normal form function. (Contributed by Mario Carneiro, 25-May-2015.) (Revised by AV, 28-Jun-2019.)

Hypotheses

Ref	Expression
cantnfs.s	⊢ 𝑆 = dom (𝐴 CNF 𝐵)
cantnfs.a	⊢ (𝜑 → 𝐴 ∈ On)
cantnfs.b	⊢ (𝜑 → 𝐵 ∈ On)
cantnfcl.g	⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
cantnfcl.f	⊢ (𝜑 → 𝐹 ∈ 𝑆)
cantnfval.h	⊢ 𝐻 = seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧)), ∅)

Assertion

Ref	Expression
cantnfval	⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = (𝐻‘dom 𝐺))

Distinct variable groups:   𝑧,𝑘,𝐵   𝐴,𝑘,𝑧   𝑘,𝐹,𝑧   𝑆,𝑘,𝑧   𝑘,𝐺,𝑧   𝜑,𝑘,𝑧

Allowed substitution hints:   𝐻(𝑧,𝑘)

Proof of Theorem cantnfval

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2610	. . . 4 ⊢ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} = {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅}
2		cantnfs.a	. . . 4 ⊢ (𝜑 → 𝐴 ∈ On)
3		cantnfs.b	. . . 4 ⊢ (𝜑 → 𝐵 ∈ On)
4	1, 2, 3	cantnffval 8443	. . 3 ⊢ (𝜑 → (𝐴 CNF 𝐵) = (𝑓 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ)))
5	4	fveq1d 6105	. 2 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = ((𝑓 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ))‘𝐹))
6		cantnfcl.f	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑆)
7		cantnfs.s	. . . . 5 ⊢ 𝑆 = dom (𝐴 CNF 𝐵)
8	1, 2, 3	cantnfdm 8444	. . . . 5 ⊢ (𝜑 → dom (𝐴 CNF 𝐵) = {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅})
9	7, 8	syl5eq 2656	. . . 4 ⊢ (𝜑 → 𝑆 = {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅})
10	6, 9	eleqtrd 2690	. . 3 ⊢ (𝜑 → 𝐹 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅})
11		ovex 6577	. . . . . 6 ⊢ (𝑓 supp ∅) ∈ V
12		eqid 2610	. . . . . . 7 ⊢ OrdIso( E , (𝑓 supp ∅)) = OrdIso( E , (𝑓 supp ∅))
13	12	oiexg 8323	. . . . . 6 ⊢ ((𝑓 supp ∅) ∈ V → OrdIso( E , (𝑓 supp ∅)) ∈ V)
14	11, 13	mp1i 13	. . . . 5 ⊢ (𝑓 = 𝐹 → OrdIso( E , (𝑓 supp ∅)) ∈ V)
15		simpr 476	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → ℎ = OrdIso( E , (𝑓 supp ∅)))
16		oveq1 6556	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 = 𝐹 → (𝑓 supp ∅) = (𝐹 supp ∅))
17	16	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (𝑓 supp ∅) = (𝐹 supp ∅))
18		oieq2 8301	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 supp ∅) = (𝐹 supp ∅) → OrdIso( E , (𝑓 supp ∅)) = OrdIso( E , (𝐹 supp ∅)))
19	17, 18	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → OrdIso( E , (𝑓 supp ∅)) = OrdIso( E , (𝐹 supp ∅)))
20	15, 19	eqtrd 2644	. . . . . . . . . . . . . 14 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → ℎ = OrdIso( E , (𝐹 supp ∅)))
21		cantnfcl.g	. . . . . . . . . . . . . 14 ⊢ 𝐺 = OrdIso( E , (𝐹 supp ∅))
22	20, 21	syl6eqr 2662	. . . . . . . . . . . . 13 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → ℎ = 𝐺)
23	22	fveq1d 6105	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (ℎ‘𝑘) = (𝐺‘𝑘))
24	23	oveq2d 6565	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (𝐴 ↑𝑜 (ℎ‘𝑘)) = (𝐴 ↑𝑜 (𝐺‘𝑘)))
25		simpl 472	. . . . . . . . . . . 12 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → 𝑓 = 𝐹)
26	25, 23	fveq12d 6109	. . . . . . . . . . 11 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (𝑓‘(ℎ‘𝑘)) = (𝐹‘(𝐺‘𝑘)))
27	24, 26	oveq12d 6567	. . . . . . . . . 10 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → ((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) = ((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))))
28	27	oveq1d 6564	. . . . . . . . 9 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧) = (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧))
29	28	mpt2eq3dv 6619	. . . . . . . 8 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)) = (𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧)))
30		eqid 2610	. . . . . . . 8 ⊢ ∅ = ∅
31		seqomeq12 7436	. . . . . . . 8 ⊢ (((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)) = (𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧)) ∧ ∅ = ∅) → seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅) = seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧)), ∅))
32	29, 30, 31	sylancl 693	. . . . . . 7 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅) = seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧)), ∅))
33		cantnfval.h	. . . . . . 7 ⊢ 𝐻 = seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (𝐺‘𝑘)) ·𝑜 (𝐹‘(𝐺‘𝑘))) +𝑜 𝑧)), ∅)
34	32, 33	syl6eqr 2662	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅) = 𝐻)
35	22	dmeqd 5248	. . . . . 6 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → dom ℎ = dom 𝐺)
36	34, 35	fveq12d 6109	. . . . 5 ⊢ ((𝑓 = 𝐹 ∧ ℎ = OrdIso( E , (𝑓 supp ∅))) → (seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ) = (𝐻‘dom 𝐺))
37	14, 36	csbied 3526	. . . 4 ⊢ (𝑓 = 𝐹 → ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ) = (𝐻‘dom 𝐺))
38		eqid 2610	. . . 4 ⊢ (𝑓 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ)) = (𝑓 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ))
39		fvex 6113	. . . 4 ⊢ (𝐻‘dom 𝐺) ∈ V
40	37, 38, 39	fvmpt 6191	. . 3 ⊢ (𝐹 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} → ((𝑓 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ))‘𝐹) = (𝐻‘dom 𝐺))
41	10, 40	syl 17	. 2 ⊢ (𝜑 → ((𝑓 ∈ {𝑔 ∈ (𝐴 ↑𝑚 𝐵) ∣ 𝑔 finSupp ∅} ↦ ⦋OrdIso( E , (𝑓 supp ∅)) / ℎ⦌(seq𝜔((𝑘 ∈ V, 𝑧 ∈ V ↦ (((𝐴 ↑𝑜 (ℎ‘𝑘)) ·𝑜 (𝑓‘(ℎ‘𝑘))) +𝑜 𝑧)), ∅)‘dom ℎ))‘𝐹) = (𝐻‘dom 𝐺))
42	5, 41	eqtrd 2644	1 ⊢ (𝜑 → ((𝐴 CNF 𝐵)‘𝐹) = (𝐻‘dom 𝐺))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  {crab 2900  Vcvv 3173  ⦋csb 3499  ∅c0 3874   class class class wbr 4583   ↦ cmpt 4643   E cep 4947  dom cdm 5038  Oncon0 5640  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551   supp csupp 7182  seq_𝜔cseqom 7429   +_𝑜 coa 7444   ·_𝑜 comu 7445   ↑_𝑜 coe 7446   ↑_𝑚 cmap 7744   finSupp cfsupp 8158  OrdIsocoi 8297   CNF ccnf 8441

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-fal 1481  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-se 4998  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-isom 5813  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-seqom 7430  df-oi 8298  df-cnf 8442

This theorem is referenced by:  cantnfval2  8449  cantnfle  8451  cantnflt2  8453  cantnff  8454  cantnf0  8455  cantnfp1lem3  8460  cantnflem1  8469  cantnf  8473  cnfcom2  8482