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 44507
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 7809 . . . . . . 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 6551 . . . . 5 (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
8 df-f 6551 . . . . 5 (𝐹:𝐴⟶On ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On))
96, 7, 83imtr4g 299 . . . 4 (𝐵 ∈ On → (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶On))
10 elmapi 8883 . . . 4 (𝐹 ∈ (𝐵 ↑m 𝐴) → 𝐹:𝐴⟶𝐵)
119, 10impel 515 . . 3 ((𝐵 ∈ On ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
1211adantll 727 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
13 peano1 7910 . . 3 ∅ ∈ ω
14 fnconstg 6781 . . 3 (∅ ∈ ω → (𝐴 × {∅}) Fn 𝐴)
1513, 14mp1i 14 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → (𝐴 × {∅}) Fn 𝐴)
16 simp3 1156 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → (𝐴 × {∅}) Fn 𝐴)
17 simp2 1155 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹:𝐴⟶On)
1817ffnd 6721 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹 Fn 𝐴)
19 simp1 1154 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐴 ∈ 𝑉)
20 inidm 4126 . . . 4 (𝐴 ∩ 𝐴) = 𝐴
2116, 18, 19, 19, 20offn 7716 . . 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 7720 . . . . 5 ((((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴)) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
2723, 24, 25, 26syl12anc 850 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
28 fvconst2g 7218 . . . . . 6 ((∅ ∈ ω ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
2913, 25, 28sylancr 599 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
3029oveq1d 7445 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)) = (∅ +o (𝐹‘𝑎)))
3117ffvelcdmda 7095 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ On)
32 oa0r 8560 . . . . 5 ((𝐹‘𝑎) ∈ On → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
3331, 32syl 18 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
3427, 30, 333eqtrd 2802 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (𝐹‘𝑎))
3521, 18, 34eqfnfvd 7043 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)
361, 12, 15, 35syl3anc 1398 1 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → ((𝐴 × {∅}) ∘f +o 𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   ⊆ wss 3900  ∅c0 4281  {csn 4588   × cxp 5653  ran crn 5656  Oncon0 6369   Fn wfn 6542  ⟶wf 6543  ‘cfv 6547  (class class class)co 7430   ∘f cof 7701  ωcom 7887   +o coa 8487   ↑m cmap 8861
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-of 7703  df-om 7888  df-1st 8011  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-oadd 8494  df-map 8863
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator