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

Theorem fthpropd 16352
Description: If two categories have the same set of objects, morphisms, and compositions, then they have the same faithful functors. (Contributed by Mario Carneiro, 27-Jan-2017.)
Hypotheses
Ref Expression
fullpropd.1 (𝜑 → (Homf𝐴) = (Homf𝐵))
fullpropd.2 (𝜑 → (compf𝐴) = (compf𝐵))
fullpropd.3 (𝜑 → (Homf𝐶) = (Homf𝐷))
fullpropd.4 (𝜑 → (compf𝐶) = (compf𝐷))
fullpropd.a (𝜑𝐴𝑉)
fullpropd.b (𝜑𝐵𝑉)
fullpropd.c (𝜑𝐶𝑉)
fullpropd.d (𝜑𝐷𝑉)
Assertion
Ref Expression
fthpropd (𝜑 → (𝐴 Faith 𝐶) = (𝐵 Faith 𝐷))

Proof of Theorem fthpropd
Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfth 16340 . 2 Rel (𝐴 Faith 𝐶)
2 relfth 16340 . 2 Rel (𝐵 Faith 𝐷)
3 fullpropd.1 . . . . . 6 (𝜑 → (Homf𝐴) = (Homf𝐵))
4 fullpropd.2 . . . . . 6 (𝜑 → (compf𝐴) = (compf𝐵))
5 fullpropd.3 . . . . . 6 (𝜑 → (Homf𝐶) = (Homf𝐷))
6 fullpropd.4 . . . . . 6 (𝜑 → (compf𝐶) = (compf𝐷))
7 fullpropd.a . . . . . 6 (𝜑𝐴𝑉)
8 fullpropd.b . . . . . 6 (𝜑𝐵𝑉)
9 fullpropd.c . . . . . 6 (𝜑𝐶𝑉)
10 fullpropd.d . . . . . 6 (𝜑𝐷𝑉)
113, 4, 5, 6, 7, 8, 9, 10funcpropd 16331 . . . . 5 (𝜑 → (𝐴 Func 𝐶) = (𝐵 Func 𝐷))
1211breqd 4588 . . . 4 (𝜑 → (𝑓(𝐴 Func 𝐶)𝑔𝑓(𝐵 Func 𝐷)𝑔))
133homfeqbas 16127 . . . . 5 (𝜑 → (Base‘𝐴) = (Base‘𝐵))
1413raleqdv 3120 . . . . 5 (𝜑 → (∀𝑦 ∈ (Base‘𝐴)Fun (𝑥𝑔𝑦) ↔ ∀𝑦 ∈ (Base‘𝐵)Fun (𝑥𝑔𝑦)))
1513, 14raleqbidv 3128 . . . 4 (𝜑 → (∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)Fun (𝑥𝑔𝑦) ↔ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)Fun (𝑥𝑔𝑦)))
1612, 15anbi12d 742 . . 3 (𝜑 → ((𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)Fun (𝑥𝑔𝑦)) ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)Fun (𝑥𝑔𝑦))))
17 eqid 2609 . . . 4 (Base‘𝐴) = (Base‘𝐴)
1817isfth 16345 . . 3 (𝑓(𝐴 Faith 𝐶)𝑔 ↔ (𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)Fun (𝑥𝑔𝑦)))
19 eqid 2609 . . . 4 (Base‘𝐵) = (Base‘𝐵)
2019isfth 16345 . . 3 (𝑓(𝐵 Faith 𝐷)𝑔 ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)Fun (𝑥𝑔𝑦)))
2116, 18, 203bitr4g 301 . 2 (𝜑 → (𝑓(𝐴 Faith 𝐶)𝑔𝑓(𝐵 Faith 𝐷)𝑔))
221, 2, 21eqbrrdiv 5129 1 (𝜑 → (𝐴 Faith 𝐶) = (𝐵 Faith 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 382   = wceq 1474  wcel 1976  wral 2895   class class class wbr 4577  ccnv 5026  Fun wfun 5783  cfv 5789  (class class class)co 6526  Basecbs 15643  Homf chomf 16098  compfccomf 16099   Func cfunc 16285   Faith cfth 16334
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2033  ax-13 2233  ax-ext 2589  ax-rep 4693  ax-sep 4703  ax-nul 4711  ax-pow 4763  ax-pr 4827  ax-un 6824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-fal 1480  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-reu 2902  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-pw 4109  df-sn 4125  df-pr 4127  df-op 4131  df-uni 4367  df-iun 4451  df-br 4578  df-opab 4638  df-mpt 4639  df-id 4942  df-xp 5033  df-rel 5034  df-cnv 5035  df-co 5036  df-dm 5037  df-rn 5038  df-res 5039  df-ima 5040  df-iota 5753  df-fun 5791  df-fn 5792  df-f 5793  df-f1 5794  df-fo 5795  df-f1o 5796  df-fv 5797  df-riota 6488  df-ov 6529  df-oprab 6530  df-mpt2 6531  df-1st 7036  df-2nd 7037  df-map 7723  df-ixp 7772  df-cat 16100  df-cid 16101  df-homf 16102  df-comf 16103  df-func 16289  df-fth 16336
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator