Theorem ofoaid2 44012

Description: Identity law for component wise addition of ordinal-yielding functions. (Contributed by RP, 5-Jan-2025.)

Assertion

Ref	Expression
ofoaid2	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)

Proof of Theorem ofoaid2

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 778	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐴 ∈ 𝑉)
2		onss 7784	. . . . . . 7 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On)
3		sstr 3953	. . . . . . . 8 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ On) → ran 𝐹 ⊆ On)
4	3	expcom 418	. . . . . . 7 ⊢ (𝐵 ⊆ On → (ran 𝐹 ⊆ 𝐵 → ran 𝐹 ⊆ On))
5	2, 4	syl 18	. . . . . 6 ⊢ (𝐵 ∈ On → (ran 𝐹 ⊆ 𝐵 → ran 𝐹 ⊆ On))
6	5	anim2d 623	. . . . 5 ⊢ (𝐵 ∈ On → ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵) → (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On)))
7		df-f 6541	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
8		df-f 6541	. . . . 5 ⊢ (𝐹:𝐴⟶On ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On))
9	6, 7, 8	3imtr4g 299	. . . 4 ⊢ (𝐵 ∈ On → (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶On))
10		elmapi 8846	. . . 4 ⊢ (𝐹 ∈ (𝐵 ↑m 𝐴) → 𝐹:𝐴⟶𝐵)
11	9, 10	impel 514	. . 3 ⊢ ((𝐵 ∈ On ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
12	11	adantll 726	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
13		peano1 7885	. . 3 ⊢ ∅ ∈ ω
14		fnconstg 6767	. . 3 ⊢ (∅ ∈ ω → (𝐴 × {∅}) Fn 𝐴)
15	13, 14	mp1i 14	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → (𝐴 × {∅}) Fn 𝐴)
16		simp3 1154	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → (𝐴 × {∅}) Fn 𝐴)
17		simp2 1153	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹:𝐴⟶On)
18	17	ffnd 6707	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹 Fn 𝐴)
19		simp1 1152	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐴 ∈ 𝑉)
20		inidm 4187	. . . 4 ⊢ (𝐴 ∩ 𝐴) = 𝐴
21	16, 18, 19, 19, 20	offn 7688	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) ∘f +o 𝐹) Fn 𝐴)
22	16, 18	jca 520	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴))
23	22	adantr 485	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴))
24	19	adantr 485	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → 𝐴 ∈ 𝑉)
25		simpr 489	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
26		fnfvof 7692	. . . . 5 ⊢ ((((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴)) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
27	23, 24, 25, 26	syl12anc 849	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
28		fvconst2g 7201	. . . . . 6 ⊢ ((∅ ∈ ω ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
29	13, 25, 28	sylancr 598	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
30	29	oveq1d 7426	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)) = (∅ +o (𝐹‘𝑎)))
31	17	ffvelcdmda 7080	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ On)
32		oa0r 8523	. . . . 5 ⊢ ((𝐹‘𝑎) ∈ On → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
33	31, 32	syl 18	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
34	27, 30, 33	3eqtrd 2808	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (𝐹‘𝑎))
35	21, 18, 34	eqfnfvd 7029	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)
36	1, 12, 15, 35	syl3anc 1396	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ⊆ wss 3913  ∅c0 4294  {csn 4594   × cxp 5660  ran crn 5663  Oncon0 6361   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  (class class class)co 7411   ∘_f cof 7673  ωcom 7862   +_o coa 8450   ↑_m cmap 8824

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-of 7675  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-oadd 8457  df-map 8826

This theorem is referenced by: (None)