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 44360
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 7799 . . . . . . 7 (𝐵 ∈ On → 𝐵 ⊆ On)
3 sstr 3939 . . . . . . . 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 6542 . . . . 5 (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
8 df-f 6542 . . . . 5 (𝐹:𝐴⟶On ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On))
96, 7, 83imtr4g 299 . . . 4 (𝐵 ∈ On → (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶On))
10 elmapi 8869 . . . 4 (𝐹 ∈ (𝐵 ↑m 𝐴) → 𝐹:𝐴⟶𝐵)
119, 10impel 515 . . 3 ((𝐵 ∈ On ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
1211adantll 727 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
13 peano1 7900 . . 3 ∅ ∈ ω
14 fnconstg 6770 . . 3 (∅ ∈ ω → (𝐴 × {∅}) Fn 𝐴)
1513, 14mp1i 14 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → (𝐴 × {∅}) Fn 𝐴)
16 simp3 1156 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → (𝐴 × {∅}) Fn 𝐴)
17 simp2 1155 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹:𝐴⟶On)
1817ffnd 6710 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹 Fn 𝐴)
19 simp1 1154 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐴 ∈ 𝑉)
20 inidm 4172 . . . 4 (𝐴 ∩ 𝐴) = 𝐴
2116, 18, 19, 19, 20offn 7706 . . 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 7710 . . . . 5 ((((𝐴 × {∅}) Fn 𝐴 ∧ 𝐹 Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴)) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
2723, 24, 25, 26syl12anc 850 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)))
28 fvconst2g 7208 . . . . . 6 ((∅ ∈ ω ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
2913, 25, 28sylancr 599 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
3029oveq1d 7435 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅})‘𝑎) +o (𝐹‘𝑎)) = (∅ +o (𝐹‘𝑎)))
3117ffvelcdmda 7084 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ On)
32 oa0r 8546 . . . . 5 ((𝐹‘𝑎) ∈ On → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
3331, 32syl 18 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (∅ +o (𝐹‘𝑎)) = (𝐹‘𝑎))
3427, 30, 333eqtrd 2800 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (((𝐴 × {∅}) ∘f +o 𝐹)‘𝑎) = (𝐹‘𝑎))
3521, 18, 34eqfnfvd 7032 . 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 1570   ∈ wcel 2145   ⊆ wss 3899  ∅c0 4279  {csn 4584   × cxp 5649  ran crn 5652  Oncon0 6362   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∘f cof 7691  ωcom 7877   +o coa 8473   ↑m cmap 8847
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-of 7693  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-oadd 8480  df-map 8849
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator