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

Theorem fullpropd 17882
Description: If two categories have the same set of objects, morphisms, and compositions, then they have the same full 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
fullpropd (𝜑 → (𝐴 Full 𝐶) = (𝐵 Full 𝐷))

Proof of Theorem fullpropd
Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relfull 17870 . 2 Rel (𝐴 Full 𝐶)
2 relfull 17870 . 2 Rel (𝐵 Full 𝐷)
3 fullpropd.1 . . . . . . . 8 (𝜑 → (Homf𝐴) = (Homf𝐵))
43homfeqbas 17649 . . . . . . 7 (𝜑 → (Base‘𝐴) = (Base‘𝐵))
54adantr 480 . . . . . 6 ((𝜑𝑓(𝐴 Func 𝐶)𝑔) → (Base‘𝐴) = (Base‘𝐵))
65adantr 480 . . . . . . 7 (((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) → (Base‘𝐴) = (Base‘𝐵))
7 eqid 2726 . . . . . . . . 9 (Base‘𝐶) = (Base‘𝐶)
8 eqid 2726 . . . . . . . . 9 (Hom ‘𝐶) = (Hom ‘𝐶)
9 eqid 2726 . . . . . . . . 9 (Hom ‘𝐷) = (Hom ‘𝐷)
10 fullpropd.3 . . . . . . . . . 10 (𝜑 → (Homf𝐶) = (Homf𝐷))
1110ad3antrrr 727 . . . . . . . . 9 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (Homf𝐶) = (Homf𝐷))
12 eqid 2726 . . . . . . . . . . 11 (Base‘𝐴) = (Base‘𝐴)
13 simpllr 773 . . . . . . . . . . 11 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑓(𝐴 Func 𝐶)𝑔)
1412, 7, 13funcf1 17825 . . . . . . . . . 10 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑓:(Base‘𝐴)⟶(Base‘𝐶))
15 simplr 766 . . . . . . . . . 10 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑥 ∈ (Base‘𝐴))
1614, 15ffvelcdmd 7081 . . . . . . . . 9 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (𝑓𝑥) ∈ (Base‘𝐶))
17 simpr 484 . . . . . . . . . 10 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑦 ∈ (Base‘𝐴))
1814, 17ffvelcdmd 7081 . . . . . . . . 9 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (𝑓𝑦) ∈ (Base‘𝐶))
197, 8, 9, 11, 16, 18homfeqval 17650 . . . . . . . 8 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦)) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦)))
2019eqeq2d 2737 . . . . . . 7 ((((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦)) ↔ ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦))))
216, 20raleqbidva 3321 . . . . . 6 (((𝜑𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) → (∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦)) ↔ ∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦))))
225, 21raleqbidva 3321 . . . . 5 ((𝜑𝑓(𝐴 Func 𝐶)𝑔) → (∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦)) ↔ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦))))
2322pm5.32da 578 . . . 4 (𝜑 → ((𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))) ↔ (𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦)))))
24 fullpropd.2 . . . . . . 7 (𝜑 → (compf𝐴) = (compf𝐵))
25 fullpropd.4 . . . . . . 7 (𝜑 → (compf𝐶) = (compf𝐷))
26 fullpropd.a . . . . . . 7 (𝜑𝐴𝑉)
27 fullpropd.b . . . . . . 7 (𝜑𝐵𝑉)
28 fullpropd.c . . . . . . 7 (𝜑𝐶𝑉)
29 fullpropd.d . . . . . . 7 (𝜑𝐷𝑉)
303, 24, 10, 25, 26, 27, 28, 29funcpropd 17862 . . . . . 6 (𝜑 → (𝐴 Func 𝐶) = (𝐵 Func 𝐷))
3130breqd 5152 . . . . 5 (𝜑 → (𝑓(𝐴 Func 𝐶)𝑔𝑓(𝐵 Func 𝐷)𝑔))
3231anbi1d 629 . . . 4 (𝜑 → ((𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦))) ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦)))))
3323, 32bitrd 279 . . 3 (𝜑 → ((𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))) ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦)))))
3412, 8isfull 17872 . . 3 (𝑓(𝐴 Full 𝐶)𝑔 ↔ (𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐶)(𝑓𝑦))))
35 eqid 2726 . . . 4 (Base‘𝐵) = (Base‘𝐵)
3635, 9isfull 17872 . . 3 (𝑓(𝐵 Full 𝐷)𝑔 ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓𝑥)(Hom ‘𝐷)(𝑓𝑦))))
3733, 34, 363bitr4g 314 . 2 (𝜑 → (𝑓(𝐴 Full 𝐶)𝑔𝑓(𝐵 Full 𝐷)𝑔))
381, 2, 37eqbrrdiv 5787 1 (𝜑 → (𝐴 Full 𝐶) = (𝐵 Full 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1533  wcel 2098  wral 3055   class class class wbr 5141  ran crn 5670  cfv 6537  (class class class)co 7405  Basecbs 17153  Hom chom 17217  Homf chomf 17619  compfccomf 17620   Func cfunc 17813   Full cful 17864
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7974  df-2nd 7975  df-map 8824  df-ixp 8894  df-cat 17621  df-cid 17622  df-homf 17623  df-comf 17624  df-func 17817  df-full 17866
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator