Theorem fullpropd 17636

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.

Step	Hyp	Ref	Expression
1		relfull 17624	. 2 ⊢ Rel (𝐴 Full 𝐶)
2		relfull 17624	. 2 ⊢ Rel (𝐵 Full 𝐷)
3		fullpropd.1	. . . . . . . 8 ⊢ (𝜑 → (Homf ‘𝐴) = (Homf ‘𝐵))
4	3	homfeqbas 17405	. . . . . . 7 ⊢ (𝜑 → (Base‘𝐴) = (Base‘𝐵))
5	4	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) → (Base‘𝐴) = (Base‘𝐵))
6	5	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) → (Base‘𝐴) = (Base‘𝐵))
7		eqid 2738	. . . . . . . . 9 ⊢ (Base‘𝐶) = (Base‘𝐶)
8		eqid 2738	. . . . . . . . 9 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
9		eqid 2738	. . . . . . . . 9 ⊢ (Hom ‘𝐷) = (Hom ‘𝐷)
10		fullpropd.3	. . . . . . . . . 10 ⊢ (𝜑 → (Homf ‘𝐶) = (Homf ‘𝐷))
11	10	ad3antrrr 727	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (Homf ‘𝐶) = (Homf ‘𝐷))
12		eqid 2738	. . . . . . . . . . 11 ⊢ (Base‘𝐴) = (Base‘𝐴)
13		simpllr 773	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑓(𝐴 Func 𝐶)𝑔)
14	12, 7, 13	funcf1 17581	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑓:(Base‘𝐴)⟶(Base‘𝐶))
15		simplr 766	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑥 ∈ (Base‘𝐴))
16	14, 15	ffvelrnd 6962	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (𝑓‘𝑥) ∈ (Base‘𝐶))
17		simpr 485	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → 𝑦 ∈ (Base‘𝐴))
18	14, 17	ffvelrnd 6962	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (𝑓‘𝑦) ∈ (Base‘𝐶))
19	7, 8, 9, 11, 16, 18	homfeqval 17406	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → ((𝑓‘𝑥)(Hom ‘𝐶)(𝑓‘𝑦)) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))
20	19	eqeq2d 2749	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) ∧ 𝑦 ∈ (Base‘𝐴)) → (ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐶)(𝑓‘𝑦)) ↔ ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))
21	6, 20	raleqbidva 3354	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) ∧ 𝑥 ∈ (Base‘𝐴)) → (∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐶)(𝑓‘𝑦)) ↔ ∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))
22	5, 21	raleqbidva 3354	. . . . 5 ⊢ ((𝜑 ∧ 𝑓(𝐴 Func 𝐶)𝑔) → (∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐶)(𝑓‘𝑦)) ↔ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))
23	22	pm5.32da 579	. . . 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 ⊢ (𝜑 → 𝐷 ∈ 𝑉)
30	3, 24, 10, 25, 26, 27, 28, 29	funcpropd 17616	. . . . . 6 ⊢ (𝜑 → (𝐴 Func 𝐶) = (𝐵 Func 𝐷))
31	30	breqd 5085	. . . . 5 ⊢ (𝜑 → (𝑓(𝐴 Func 𝐶)𝑔 ↔ 𝑓(𝐵 Func 𝐷)𝑔))
32	31	anbi1d 630	. . . 4 ⊢ (𝜑 → ((𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))) ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))))
33	23, 32	bitrd 278	. . 3 ⊢ (𝜑 → ((𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐶)(𝑓‘𝑦))) ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦)))))
34	12, 8	isfull 17626	. . 3 ⊢ (𝑓(𝐴 Full 𝐶)𝑔 ↔ (𝑓(𝐴 Func 𝐶)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐴)∀𝑦 ∈ (Base‘𝐴)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐶)(𝑓‘𝑦))))
35		eqid 2738	. . . 4 ⊢ (Base‘𝐵) = (Base‘𝐵)
36	35, 9	isfull 17626	. . 3 ⊢ (𝑓(𝐵 Full 𝐷)𝑔 ↔ (𝑓(𝐵 Func 𝐷)𝑔 ∧ ∀𝑥 ∈ (Base‘𝐵)∀𝑦 ∈ (Base‘𝐵)ran (𝑥𝑔𝑦) = ((𝑓‘𝑥)(Hom ‘𝐷)(𝑓‘𝑦))))
37	33, 34, 36	3bitr4g 314	. 2 ⊢ (𝜑 → (𝑓(𝐴 Full 𝐶)𝑔 ↔ 𝑓(𝐵 Full 𝐷)𝑔))
38	1, 2, 37	eqbrrdiv 5704	1 ⊢ (𝜑 → (𝐴 Full 𝐶) = (𝐵 Full 𝐷))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∀wral 3064   class class class wbr 5074  ran crn 5590  ‘cfv 6433  (class class class)co 7275  Basecbs 16912  Hom chom 16973  Hom_f chomf 17375  comp_fccomf 17376   Func cfunc 17569   Full cful 17618

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-map 8617  df-ixp 8686  df-cat 17377  df-cid 17378  df-homf 17379  df-comf 17380  df-func 17573  df-full 17620

This theorem is referenced by: (None)