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

Theorem coapm 18296
Description: Composition of arrows is a partial binary operation on arrows. (Contributed by Mario Carneiro, 11-Jan-2017.)
Hypotheses
Ref Expression
coapm.o · = (compa‘𝐶)
coapm.a 𝐴 = (Arrow‘𝐶)
Assertion
Ref Expression
coapm · ∈ (𝐴 ↑pm (𝐴 × 𝐴))

Proof of Theorem coapm
Dummy variables 𝑓 𝑔 ℎ 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 coapm.o . . . . . 6 · = (compa‘𝐶)
2 coapm.a . . . . . 6 𝐴 = (Arrow‘𝐶)
3 eqid 2763 . . . . . 6 (comp‘𝐶) = (comp‘𝐶)
41, 2, 3coafval 18289 . . . . 5 · = (𝑔 ∈ 𝐴, 𝑓 ∈ {ℎ ∈ 𝐴 ∣ (coda‘ℎ) = (doma‘𝑔)} ↦ ⟨(doma‘𝑓), (coda‘𝑔), ((2nd ‘𝑔)(⟨(doma‘𝑓), (doma‘𝑔)⟩(comp‘𝐶)(coda‘𝑔))(2nd ‘𝑓))⟩)
54mpofun 7575 . . . 4 Fun ·
6 funfn 6598 . . . 4 (Fun · ↔ · Fn dom · )
75, 6mpbi 233 . . 3 · Fn dom ·
81, 2dmcoass 18291 . . . . . . . . 9 dom · ⊆ (𝐴 × 𝐴)
98sseli 3909 . . . . . . . 8 (𝑧 ∈ dom · → 𝑧 ∈ (𝐴 × 𝐴))
10 1st2nd2 8074 . . . . . . . 8 (𝑧 ∈ (𝐴 × 𝐴) → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
119, 10syl 18 . . . . . . 7 (𝑧 ∈ dom · → 𝑧 = ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
1211fveq2d 6920 . . . . . 6 (𝑧 ∈ dom · → ( · ‘𝑧) = ( · ‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩))
13 df-ov 7454 . . . . . 6 ((1st ‘𝑧) · (2nd ‘𝑧)) = ( · ‘⟨(1st ‘𝑧), (2nd ‘𝑧)⟩)
1412, 13eqtr4di 2816 . . . . 5 (𝑧 ∈ dom · → ( · ‘𝑧) = ((1st ‘𝑧) · (2nd ‘𝑧)))
15 eqid 2763 . . . . . . 7 (Homa‘𝐶) = (Homa‘𝐶)
162, 15homarw 18271 . . . . . 6 ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(coda‘(1st ‘𝑧))) ⊆ 𝐴
17 id 23 . . . . . . . . . . . . 13 (𝑧 ∈ dom · → 𝑧 ∈ dom · )
1811, 17eqeltrrd 2865 . . . . . . . . . . . 12 (𝑧 ∈ dom · → ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom · )
19 df-br 5109 . . . . . . . . . . . 12 ((1st ‘𝑧)dom · (2nd ‘𝑧) ↔ ⟨(1st ‘𝑧), (2nd ‘𝑧)⟩ ∈ dom · )
2018, 19sylibr 237 . . . . . . . . . . 11 (𝑧 ∈ dom · → (1st ‘𝑧)dom · (2nd ‘𝑧))
211, 2eldmcoa 18290 . . . . . . . . . . 11 ((1st ‘𝑧)dom · (2nd ‘𝑧) ↔ ((2nd ‘𝑧) ∈ 𝐴 ∧ (1st ‘𝑧) ∈ 𝐴 ∧ (coda‘(2nd ‘𝑧)) = (doma‘(1st ‘𝑧))))
2220, 21sylib 221 . . . . . . . . . 10 (𝑧 ∈ dom · → ((2nd ‘𝑧) ∈ 𝐴 ∧ (1st ‘𝑧) ∈ 𝐴 ∧ (coda‘(2nd ‘𝑧)) = (doma‘(1st ‘𝑧))))
2322simp1d 1160 . . . . . . . . 9 (𝑧 ∈ dom · → (2nd ‘𝑧) ∈ 𝐴)
242, 15arwhoma 18270 . . . . . . . . 9 ((2nd ‘𝑧) ∈ 𝐴 → (2nd ‘𝑧) ∈ ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(coda‘(2nd ‘𝑧))))
2523, 24syl 18 . . . . . . . 8 (𝑧 ∈ dom · → (2nd ‘𝑧) ∈ ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(coda‘(2nd ‘𝑧))))
2622simp3d 1162 . . . . . . . . 9 (𝑧 ∈ dom · → (coda‘(2nd ‘𝑧)) = (doma‘(1st ‘𝑧)))
2726oveq2d 7467 . . . . . . . 8 (𝑧 ∈ dom · → ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(coda‘(2nd ‘𝑧))) = ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(doma‘(1st ‘𝑧))))
2825, 27eleqtrd 2866 . . . . . . 7 (𝑧 ∈ dom · → (2nd ‘𝑧) ∈ ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(doma‘(1st ‘𝑧))))
2922simp2d 1161 . . . . . . . 8 (𝑧 ∈ dom · → (1st ‘𝑧) ∈ 𝐴)
302, 15arwhoma 18270 . . . . . . . 8 ((1st ‘𝑧) ∈ 𝐴 → (1st ‘𝑧) ∈ ((doma‘(1st ‘𝑧))(Homa‘𝐶)(coda‘(1st ‘𝑧))))
3129, 30syl 18 . . . . . . 7 (𝑧 ∈ dom · → (1st ‘𝑧) ∈ ((doma‘(1st ‘𝑧))(Homa‘𝐶)(coda‘(1st ‘𝑧))))
321, 15, 28, 31coahom 18295 . . . . . 6 (𝑧 ∈ dom · → ((1st ‘𝑧) · (2nd ‘𝑧)) ∈ ((doma‘(2nd ‘𝑧))(Homa‘𝐶)(coda‘(1st ‘𝑧))))
3316, 32sselid 3911 . . . . 5 (𝑧 ∈ dom · → ((1st ‘𝑧) · (2nd ‘𝑧)) ∈ 𝐴)
3414, 33eqeltrd 2864 . . . 4 (𝑧 ∈ dom · → ( · ‘𝑧) ∈ 𝐴)
3534rgen 3082 . . 3 ∀𝑧 ∈ dom · ( · ‘𝑧) ∈ 𝐴
36 ffnfv 7151 . . 3 ( · :dom · ⟶𝐴 ↔ ( · Fn dom · ∧ ∀𝑧 ∈ dom · ( · ‘𝑧) ∈ 𝐴))
377, 35, 36mpbir2an 724 . 2 · :dom · ⟶𝐴
382fvexi 6930 . . 3 𝐴 ∈ V
3938, 38xpex 7799 . . 3 (𝐴 × 𝐴) ∈ V
4038, 39elpm2 8940 . 2 ( · ∈ (𝐴 ↑pm (𝐴 × 𝐴)) ↔ ( · :dom · ⟶𝐴 ∧ dom · ⊆ (𝐴 × 𝐴)))
4137, 8, 40mpbir2an 724 1 · ∈ (𝐴 ↑pm (𝐴 × 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   ⊆ wss 3900  ⟨cop 4840  ⟨cotp 4863   class class class wbr 5108   × cxp 5656  dom cdm 5658  Fun wfun 6560   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034   ↑pm cpm 8886  compcco 17484  domacdoma 18245  codaccoda 18246  Arrowcarw 18247  Homachoma 18248  compaccoa 18279
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-ot 4864  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-pm 8888  df-cat 17892  df-doma 18249  df-coda 18250  df-homa 18251  df-arw 18252  df-coa 18281
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator