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

Theorem initoeu2lem0 17265
 Description: Lemma 0 for initoeu2 17268. (Contributed by AV, 9-Apr-2020.)
Hypotheses
Ref Expression
initoeu1.c (𝜑𝐶 ∈ Cat)
initoeu1.a (𝜑𝐴 ∈ (InitO‘𝐶))
initoeu2lem.x 𝑋 = (Base‘𝐶)
initoeu2lem.h 𝐻 = (Hom ‘𝐶)
initoeu2lem.i 𝐼 = (Iso‘𝐶)
initoeu2lem.o = (comp‘𝐶)
Assertion
Ref Expression
initoeu2lem0 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾))

Proof of Theorem initoeu2lem0
StepHypRef Expression
1 3simpa 1143 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))))
2 simp3 1133 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
32eqcomd 2825 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
4 initoeu2lem.x . . 3 𝑋 = (Base‘𝐶)
5 eqid 2819 . . 3 (Inv‘𝐶) = (Inv‘𝐶)
6 initoeu1.c . . . . 5 (𝜑𝐶 ∈ Cat)
76adantr 483 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐶 ∈ Cat)
87adantr 483 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐶 ∈ Cat)
9 simpr1 1189 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐴𝑋)
109adantr 483 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐴𝑋)
11 simpr2 1190 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐵𝑋)
1211adantr 483 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐵𝑋)
13 simplr3 1212 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐷𝑋)
14 initoeu2lem.i . . . . . . . 8 𝐼 = (Iso‘𝐶)
1514oveqi 7161 . . . . . . 7 (𝐵𝐼𝐴) = (𝐵(Iso‘𝐶)𝐴)
1615eleq2i 2902 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) ↔ 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1716biimpi 218 . . . . 5 (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
18173ad2ant1 1128 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1918adantl 484 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
20 initoeu2lem.h . . . . . . . 8 𝐻 = (Hom ‘𝐶)
2120oveqi 7161 . . . . . . 7 (𝐵𝐻𝐷) = (𝐵(Hom ‘𝐶)𝐷)
2221eleq2i 2902 . . . . . 6 (𝐺 ∈ (𝐵𝐻𝐷) ↔ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2322biimpi 218 . . . . 5 (𝐺 ∈ (𝐵𝐻𝐷) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
24233ad2ant3 1130 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2524adantl 484 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
26 eqid 2819 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
27 initoeu2lem.o . . . 4 = (comp‘𝐶)
284, 26, 14, 7, 11, 9isohom 17038 . . . . . . . 8 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐵𝐼𝐴) ⊆ (𝐵(Hom ‘𝐶)𝐴))
2928sseld 3964 . . . . . . 7 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3029com12 32 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
31303ad2ant1 1128 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3231impcom 410 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴))
3320oveqi 7161 . . . . . . . 8 (𝐴𝐻𝐷) = (𝐴(Hom ‘𝐶)𝐷)
3433eleq2i 2902 . . . . . . 7 (𝐹 ∈ (𝐴𝐻𝐷) ↔ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3534biimpi 218 . . . . . 6 (𝐹 ∈ (𝐴𝐻𝐷) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
36353ad2ant2 1129 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3736adantl 484 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
384, 26, 27, 8, 12, 10, 13, 32, 37catcocl 16948 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → (𝐹(⟨𝐵, 𝐴 𝐷)𝐾) ∈ (𝐵(Hom ‘𝐶)𝐷))
39 eqid 2819 . . 3 ((𝐵(Inv‘𝐶)𝐴)‘𝐾) = ((𝐵(Inv‘𝐶)𝐴)‘𝐾)
4027oveqi 7161 . . 3 (⟨𝐴, 𝐵 𝐷) = (⟨𝐴, 𝐵⟩(comp‘𝐶)𝐷)
414, 5, 8, 10, 12, 13, 19, 25, 38, 39, 40rcaninv 17056 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → ((𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾)))
421, 3, 41sylc 65 1 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1082   = wceq 1531   ∈ wcel 2108  ⟨cop 4565  ‘cfv 6348  (class class class)co 7148  Basecbs 16475  Hom chom 16568  compcco 16569  Catccat 16927  Invcinv 17007  Isociso 17008  InitOcinito 17240 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-1st 7681  df-2nd 7682  df-cat 16931  df-cid 16932  df-sect 17009  df-inv 17010  df-iso 17011 This theorem is referenced by:  initoeu2lem1  17266
 Copyright terms: Public domain W3C validator