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

Theorem cdaf 18019
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 7992 . . . . . 6 2nd :V–onto→V
2 fofn 6777 . . . . . 6 (2nd :V–onto→V → 2nd Fn V)
31, 2ax-mp 5 . . . . 5 2nd Fn V
4 fo1st 7991 . . . . . 6 1st :V–onto→V
5 fof 6775 . . . . . 6 (1st :V–onto→V → 1st :V⟶V)
64, 5ax-mp 5 . . . . 5 1st :V⟶V
7 fnfco 6728 . . . . 5 ((2nd Fn V ∧ 1st :V⟶V) → (2nd ∘ 1st ) Fn V)
83, 6, 7mp2an 692 . . . 4 (2nd ∘ 1st ) Fn V
9 df-coda 17994 . . . . 5 coda = (2nd ∘ 1st )
109fneq1i 6618 . . . 4 (coda Fn V ↔ (2nd ∘ 1st ) Fn V)
118, 10mpbir 231 . . 3 coda Fn V
12 ssv 3974 . . 3 𝐴 ⊆ V
13 fnssres 6644 . . 3 ((coda Fn V ∧ 𝐴 ⊆ V) → (coda𝐴) Fn 𝐴)
1411, 12, 13mp2an 692 . 2 (coda𝐴) Fn 𝐴
15 fvres 6880 . . . 4 (𝑥𝐴 → ((coda𝐴)‘𝑥) = (coda𝑥))
16 arwrcl.a . . . . 5 𝐴 = (Arrow‘𝐶)
17 arwdm.b . . . . 5 𝐵 = (Base‘𝐶)
1816, 17arwcd 18017 . . . 4 (𝑥𝐴 → (coda𝑥) ∈ 𝐵)
1915, 18eqeltrd 2829 . . 3 (𝑥𝐴 → ((coda𝐴)‘𝑥) ∈ 𝐵)
2019rgen 3047 . 2 𝑥𝐴 ((coda𝐴)‘𝑥) ∈ 𝐵
21 ffnfv 7094 . 2 ((coda𝐴):𝐴𝐵 ↔ ((coda𝐴) Fn 𝐴 ∧ ∀𝑥𝐴 ((coda𝐴)‘𝑥) ∈ 𝐵))
2214, 20, 21mpbir2an 711 1 (coda𝐴):𝐴𝐵
Colors of variables: wff setvar class
Syntax hints:   = wceq 1540  wcel 2109  wral 3045  Vcvv 3450  wss 3917  cres 5643  ccom 5645   Fn wfn 6509  wf 6510  ontowfo 6512  cfv 6514  1st c1st 7969  2nd c2nd 7970  Basecbs 17186  codaccoda 17990  Arrowcarw 17991
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-1st 7971  df-2nd 7972  df-doma 17993  df-coda 17994  df-homa 17995  df-arw 17996
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator