MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cdaf Structured version   Visualization version   GIF version

Theorem cdaf 18218
Description: The codomain function is a function from arrows to objects. (Contributed by Mario Carneiro, 11-Jan-2017.)
Hypotheses
Ref Expression
arwrcl.a 𝐴 = (Arrow‘𝐶)
arwdm.b 𝐵 = (Base‘𝐶)
Assertion
Ref Expression
cdaf (coda ↾ 𝐴):𝐴⟶𝐵

Proof of Theorem cdaf
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fo2nd 8020 . . . . . 6 2nd :V–onto→V
2 fofn 6796 . . . . . 6 (2nd :V–onto→V → 2nd Fn V)
31, 2ax-mp 5 . . . . 5 2nd Fn V
4 fo1st 8019 . . . . . 6 1st :V–onto→V
5 fof 6794 . . . . . 6 (1st :V–onto→V → 1st :V⟶V)
64, 5ax-mp 5 . . . . 5 1st :V⟶V
7 fnfco 6745 . . . . 5 ((2nd Fn V ∧ 1st :V⟶V) → (2nd ∘ 1st ) Fn V)
83, 6, 7mp2an 705 . . . 4 (2nd ∘ 1st ) Fn V
9 df-coda 18193 . . . . 5 coda = (2nd ∘ 1st )
109fneq1i 6634 . . . 4 (coda Fn V ↔ (2nd ∘ 1st ) Fn V)
118, 10mpbir 234 . . 3 coda Fn V
12 ssv 3955 . . 3 𝐴 ⊆ V
13 fnssres 6660 . . 3 ((coda Fn V ∧ 𝐴 ⊆ V) → (coda ↾ 𝐴) Fn 𝐴)
1411, 12, 13mp2an 705 . 2 (coda ↾ 𝐴) Fn 𝐴
15 fvres 6902 . . . 4 (𝑥 ∈ 𝐴 → ((coda ↾ 𝐴)‘𝑥) = (coda‘𝑥))
16 arwrcl.a . . . . 5 𝐴 = (Arrow‘𝐶)
17 arwdm.b . . . . 5 𝐵 = (Base‘𝐶)
1816, 17arwcd 18216 . . . 4 (𝑥 ∈ 𝐴 → (coda‘𝑥) ∈ 𝐵)
1915, 18eqeltrd 2861 . . 3 (𝑥 ∈ 𝐴 → ((coda ↾ 𝐴)‘𝑥) ∈ 𝐵)
2019rgen 3079 . 2 ∀𝑥 ∈ 𝐴 ((coda ↾ 𝐴)‘𝑥) ∈ 𝐵
21 ffnfv 7117 . 2 ((coda ↾ 𝐴):𝐴⟶𝐵 ↔ ((coda ↾ 𝐴) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ((coda ↾ 𝐴)‘𝑥) ∈ 𝐵))
2214, 20, 21mpbir2an 724 1 (coda ↾ 𝐴):𝐴⟶𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ⊆ wss 3899   ↾ cres 5653   ∘ ccom 5655   Fn wfn 6532  ⟶wf 6533  –onto→wfo 6535  ‘cfv 6537  1st c1st 7997  2nd c2nd 7998  Basecbs 17380  codaccoda 18189  Arrowcarw 18190
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 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-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-id 5546  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-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 7421  df-1st 7999  df-2nd 8000  df-doma 18192  df-coda 18193  df-homa 18194  df-arw 18195
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator