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

Theorem cdaf 18124
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 8009 . . . . . 6 2nd :V–onto→V
2 fofn 6798 . . . . . 6 (2nd :V–onto→V → 2nd Fn V)
31, 2ax-mp 5 . . . . 5 2nd Fn V
4 fo1st 8008 . . . . . 6 1st :V–onto→V
5 fof 6796 . . . . . 6 (1st :V–onto→V → 1st :V⟶V)
64, 5ax-mp 5 . . . . 5 1st :V⟶V
7 fnfco 6747 . . . . 5 ((2nd Fn V ∧ 1st :V⟶V) → (2nd ∘ 1st ) Fn V)
83, 6, 7mp2an 705 . . . 4 (2nd ∘ 1st ) Fn V
9 df-coda 18099 . . . . 5 coda = (2nd ∘ 1st )
109fneq1i 6636 . . . 4 (coda Fn V ↔ (2nd ∘ 1st ) Fn V)
118, 10mpbir 234 . . 3 coda Fn V
12 ssv 3962 . . 3 𝐴 ⊆ V
13 fnssres 6662 . . 3 ((coda Fn V ∧ 𝐴 ⊆ V) → (coda𝐴) Fn 𝐴)
1411, 12, 13mp2an 705 . 2 (coda𝐴) Fn 𝐴
15 fvres 6904 . . . 4 (𝑥𝐴 → ((coda𝐴)‘𝑥) = (coda𝑥))
16 arwrcl.a . . . . 5 𝐴 = (Arrow‘𝐶)
17 arwdm.b . . . . 5 𝐵 = (Base‘𝐶)
1816, 17arwcd 18122 . . . 4 (𝑥𝐴 → (coda𝑥) ∈ 𝐵)
1915, 18eqeltrd 2865 . . 3 (𝑥𝐴 → ((coda𝐴)‘𝑥) ∈ 𝐵)
2019rgen 3083 . 2 𝑥𝐴 ((coda𝐴)‘𝑥) ∈ 𝐵
21 ffnfv 7118 . 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 2146  wral 3081  Vcvv 3457  wss 3906  cres 5665  ccom 5667   Fn wfn 6535  wf 6536  ontowfo 6538  cfv 6540  1st c1st 7986  2nd c2nd 7987  Basecbs 17286  codaccoda 18095  Arrowcarw 18096
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-1st 7988  df-2nd 7989  df-doma 18098  df-coda 18099  df-homa 18100  df-arw 18101
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator