Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ofoaid2 Structured version   Visualization version   GIF version

Theorem ofoaid2 44683
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.
StepHypRef Expression
1 simpll 779 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐴 ∈ 𝑉)
2 onss 7833 . . . . . . 7 (𝐵 ∈ On → 𝐵 ⊆ On)
3 sstr 3921 . . . . . . . 8 ((ran 𝐹 ⊆ 𝐵 ∧ 𝐵 ⊆ On) → ran 𝐹 ⊆ On)
43expcom 419 . . . . . . 7 (𝐵 ⊆ On → (ran 𝐹 ⊆ 𝐵 → ran 𝐹 ⊆ On))
52, 4syl 18 . . . . . 6 (𝐵 ∈ On → (ran 𝐹 ⊆ 𝐵 → ran 𝐹 ⊆ On))
65anim2d 624 . . . . 5 (𝐵 ∈ On → ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵) → (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On)))
7 df-f 6570 . . . . 5 (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
8 df-f 6570 . . . . 5 (𝐹:𝐴⟶On ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On))
96, 7, 83imtr4g 299 . . . 4 (𝐵 ∈ On → (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶On))
10 elmapi 8907 . . . 4 (𝐹 ∈ (𝐵 ↑m 𝐴) → 𝐹:𝐴⟶𝐵)
119, 10impel 515 . . 3 ((𝐵 ∈ On ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
1211adantll 727 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
13 peano1 7934 . . 3 ∅ ∈ ω
14 fnconstg 6800 . . 3 (∅ ∈ ω → (𝐴 × {∅}) Fn 𝐴)
1513, 14mp1i 14 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → (𝐴 × {∅}) Fn 𝐴)
16 simp3 1156 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → (𝐴 × {∅}) Fn 𝐴)
17 simp2 1155 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹:𝐴⟶On)
1817ffnd 6740 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹 Fn 𝐴)
19 simp1 1154 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐴 ∈ 𝑉)
20 inidm 4126 . . . 4 (𝐴 ∩ 𝐴) = 𝐴
2116, 18, 19, 19, 20offn 7738 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) ∘f +o 𝐹) Fn 𝐴)
2216, 18jca 521 . . . . . 6 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴))
2322adantr 486 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴))
2419adantr 486 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → 𝐴 ∈ 𝑉)
25 simpr 490 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
26 fnfvof 7742 . . . . 5 ((((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴)) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
2723, 24, 25, 26syl12anc 850 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
28 fvconst2g 7239 . . . . . 6 ((∅ ∈ ω ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
2913, 25, 28sylancr 599 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
3029oveq1d 7466 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)) = (∅ +o (𝐹‘𝑎)))
3117ffvelcdmda 7116 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ On)
32 oa0r 8584 . . . . 5 ((𝐹‘𝑎) ∈ On → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
3331, 32syl 18 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
3427, 30, 333eqtrd 2802 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (𝐹‘𝑎))
3521, 18, 34eqfnfvd 7063 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)
361, 12, 15, 35syl3anc 1399 1 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∅c0 4281  {csn 4588   × cxp 5656  ran crn 5659  Oncon0 6388   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451   ∘f cof 7723  ωcom 7911   +o coa 8511   ↑m cmap 8885
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-of 7725  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-oadd 8518  df-map 8887
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator