Theorem naddcnfid2 43646

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 7833	. . . . . 6 ⊢ ∅ ∈ ω
2		fconst6g 6724	. . . . . 6 ⊢ (∅ ∈ ω → (𝑋 × {∅}):𝑋⟶ω)
3	1, 2	mp1i 13	. . . . 5 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝑋 × {∅}):𝑋⟶ω)
4		simpl 482	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → 𝑋 ∈ On)
5	1	a1i 11	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ∅ ∈ ω)
6	4, 5	fczfsuppd 9293	. . . . 5 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝑋 × {∅}) finSupp ∅)
7		simpr 484	. . . . . . 7 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → 𝑆 = dom (ω CNF 𝑋))
8	7	eleq2d 2823	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ((𝑋 × {∅}) ∈ 𝑆 ↔ (𝑋 × {∅}) ∈ dom (ω CNF 𝑋)))
9		eqid 2737	. . . . . . 7 ⊢ dom (ω CNF 𝑋) = dom (ω CNF 𝑋)
10		omelon 9559	. . . . . . . 8 ⊢ ω ∈ On
11	10	a1i 11	. . . . . . 7 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ω ∈ On)
12	9, 11, 4	cantnfs 9579	. . . . . 6 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ((𝑋 × {∅}) ∈ dom (ω CNF 𝑋) ↔ ((𝑋 × {∅}):𝑋⟶ω ∧ (𝑋 × {∅}) finSupp ∅)))
13	8, 12	bitrd 279	. . . . 5 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → ((𝑋 × {∅}) ∈ 𝑆 ↔ ((𝑋 × {∅}):𝑋⟶ω ∧ (𝑋 × {∅}) finSupp ∅)))
14	3, 6, 13	mpbir2and 714	. . . 4 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝑋 × {∅}) ∈ 𝑆)
15		naddcnfcom 43644	. . . . 5 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ ((𝑋 × {∅}) ∈ 𝑆 ∧ 𝐹 ∈ 𝑆)) → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅})))
16	15	ex 412	. . . 4 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (((𝑋 × {∅}) ∈ 𝑆 ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅}))))
17	14, 16	mpand 696	. . 3 ⊢ ((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) → (𝐹 ∈ 𝑆 → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅}))))
18	17	imp 406	. 2 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = (𝐹 ∘f +o (𝑋 × {∅})))
19		naddcnfid1 43645	. 2 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → (𝐹 ∘f +o (𝑋 × {∅})) = 𝐹)
20	18, 19	eqtrd 2772	1 ⊢ (((𝑋 ∈ On ∧ 𝑆 = dom (ω CNF 𝑋)) ∧ 𝐹 ∈ 𝑆) → ((𝑋 × {∅}) ∘f +o 𝐹) = 𝐹)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∅c0 4286  {csn 4581   class class class wbr 5099   × cxp 5623  dom cdm 5625  Oncon0 6318  ⟶wf 6489  (class class class)co 7360   ∘_f cof 7622  ωcom 7810   +_o coa 8396   finSupp cfsupp 9268   CNF ccnf 9574

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 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-inf2 9554

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 3062  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  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-ov 7363  df-oprab 7364  df-mpo 7365  df-of 7624  df-om 7811  df-2nd 7936  df-supp 8105  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-seqom 8381  df-oadd 8403  df-map 8769  df-en 8888  df-fin 8891  df-fsupp 9269  df-cnf 9575

This theorem is referenced by: (None)