Theorem naddcnfid2 44123

Description: Identity law for component-wise ordinal addition of Cantor normal forms. (Contributed by RP, 3-Jan-2025.)

Assertion

Ref	Expression
naddcnfid2	⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = 𝐹)

Proof of Theorem naddcnfid2

Step	Hyp	Ref	Expression
1		peano1 7883	. . . . . 6 ⊢ ∅ ∈ ω
2		fconst6g 6767	. . . . . 6 ⊢ (∅ ∈ ω → (𝑋 × {∅}):𝑋⟶ω)
3	1, 2	mp1i 14	. . . . 5 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝑋 × {∅}):𝑋⟶ω)
4		simpl 487	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → 𝑋 ∈ On)
5	1	a1i 11	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ∅ ∈ ω)
6	4, 5	fczfsuppd 9344	. . . . 5 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝑋 × {∅}) finSupp ∅)
7		simpr 489	. . . . . . 7 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → 𝑆 = dom (ω CNF 𝑋))
8	7	eleq2d 2848	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ((𝑋 × {∅}) ∈ 𝑆 ↔ (𝑋 × {∅}) ∈ dom (ω CNF 𝑋)))
9		eqid 2762	. . . . . . 7 ⊢ dom (ω CNF 𝑋) = dom (ω CNF 𝑋)
10		omelon 9613	. . . . . . . 8 ⊢ ω ∈ On
11	10	a1i 11	. . . . . . 7 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ω ∈ On)
12	9, 11, 4	cantnfs 9633	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ((𝑋 × {∅}) ∈ dom (ω CNF 𝑋) ↔ ((𝑋 × {∅}):𝑋⟶ω ∧ (𝑋 × {∅}) finSupp ∅)))
13	8, 12	bitrd 282	. . . . 5 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ((𝑋 × {∅}) ∈ 𝑆 ↔ ((𝑋 × {∅}):𝑋⟶ω ∧ (𝑋 × {∅}) finSupp ∅)))
14	3, 6, 13	mpbir2and 725	. . . 4 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝑋 × {∅}) ∈ 𝑆)
15		naddcnfcom 44121	. . . . 5 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ ((𝑋 × {∅}) ∈ 𝑆 ∧ 𝐹 ∈ 𝑆)) → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅})))
16	15	ex 417	. . . 4 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (((𝑋 × {∅}) ∈ 𝑆 ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅}))))
17	14, 16	mpand 707	. . 3 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝐹 ∈ 𝑆 → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅}))))
18	17	imp 411	. 2 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅})))
19		naddcnfid1 44122	. 2 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → (𝐹 ∘f +o (𝑋 × {∅})) = 𝐹)
20	18, 19	eqtrd 2797	1 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = 𝐹)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ∅c0 4285  {csn 4588   class class class wbr 5108   × cxp 5658  dom cdm 5660  Oncon0 6360  ⟶wf 6532  (class class class)co 7412   ∘_f cof 7674  ωcom 7860   +_o coa 8448   finSupp cfsupp 9319   CNF ccnf 9628

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-inf2 9608

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7676  df-om 7861  df-2nd 7985  df-supp 8155  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-seqom 8433  df-oadd 8455  df-map 8824  df-en 8942  df-fin 8945  df-fsupp 9320  df-cnf 9629

This theorem is used by: (None)