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

Theorem ofoaid1 44303
Description: Identity law for component wise addition of ordinal-yielding functions. (Contributed by RP, 5-Jan-2025.)
Assertion
Ref Expression
ofoaid1 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → (𝐹 ∘f +o (𝐴 × {∅})) = 𝐹)

Proof of Theorem ofoaid1
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 simpll 779 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐴 ∈ 𝑉)
2 onss 7782 . . . . . . 7 (𝐵 ∈ On → 𝐵 ⊆ On)
3 sstr 3938 . . . . . . . 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 6531 . . . . 5 (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
8 df-f 6531 . . . . 5 (𝐹:𝐴⟶On ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ On))
96, 7, 83imtr4g 299 . . . 4 (𝐵 ∈ On → (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶On))
10 elmapi 8847 . . . 4 (𝐹 ∈ (𝐵 ↑m 𝐴) → 𝐹:𝐴⟶𝐵)
119, 10impel 515 . . 3 ((𝐵 ∈ On ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
1211adantll 727 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → 𝐹:𝐴⟶On)
13 peano1 7883 . . 3 ∅ ∈ ω
14 fnconstg 6758 . . 3 (∅ ∈ ω → (𝐴 × {∅}) Fn 𝐴)
1513, 14mp1i 14 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ On) ∧ 𝐹 ∈ (𝐵 ↑m 𝐴)) → (𝐴 × {∅}) Fn 𝐴)
16 simp2 1155 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹:𝐴⟶On)
1716ffnd 6698 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐹 Fn 𝐴)
18 simp3 1156 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → (𝐴 × {∅}) Fn 𝐴)
19 simp1 1154 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → 𝐴 ∈ 𝑉)
20 inidm 4171 . . . 4 (𝐴 ∩ 𝐴) = 𝐴
2117, 18, 19, 19, 20offn 7689 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) → (𝐹 ∘f +o (𝐴 × {∅})) Fn 𝐴)
2217, 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 7693 . . . . 5 (((𝐹 Fn 𝐴 ∧ (𝐴 × {∅}) Fn 𝐴) ∧ (𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴)) → ((𝐹 ∘f +o (𝐴 × {∅}))‘𝑎) = ((𝐹‘𝑎) +o ((𝐴 × {∅})‘𝑎)))
2723, 24, 25, 26syl12anc 850 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐹 ∘f +o (𝐴 × {∅}))‘𝑎) = ((𝐹‘𝑎) +o ((𝐴 × {∅})‘𝑎)))
28 fvconst2g 7196 . . . . . 6 ((∅ ∈ ω ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
2913, 25, 28sylancr 599 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐴 × {∅})‘𝑎) = ∅)
3029oveq2d 7424 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐹‘𝑎) +o ((𝐴 × {∅})‘𝑎)) = ((𝐹‘𝑎) +o ∅))
3116ffvelcdmda 7072 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ On)
32 oa0 8502 . . . . 5 ((𝐹‘𝑎) ∈ On → ((𝐹‘𝑎) +o ∅) = (𝐹‘𝑎))
3331, 32syl 18 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐹‘𝑎) +o ∅) = (𝐹‘𝑎))
3427, 30, 333eqtrd 2799 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶On ∧ (𝐴 × {∅}) Fn 𝐴) ∧ 𝑎 ∈ 𝐴) → ((𝐹 ∘f +o (𝐴 × {∅}))‘𝑎) = (𝐹‘𝑎))
3521, 17, 34eqfnfvd 7020 . 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 3898  ∅c0 4278  {csn 4583   × cxp 5645  ran crn 5648  Oncon0 6351   Fn wfn 6522  ⟶wf 6523  ‘cfv 6527  (class class class)co 7408   ∘f cof 7674  ωcom 7860   +o coa 8451   ↑m cmap 8825
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 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-of 7676  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-oadd 8458  df-map 8827
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator