MPE Home 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 1145 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))))
2 simp3 1135 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
32eqcomd 2804 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
4 initoeu2lem.x . . 3 𝑋 = (Base‘𝐶)
5 eqid 2798 . . 3 (Inv‘𝐶) = (Inv‘𝐶)
6 initoeu1.c . . . . 5 (𝜑𝐶 ∈ Cat)
76adantr 484 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐶 ∈ Cat)
87adantr 484 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐶 ∈ Cat)
9 simpr1 1191 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐴𝑋)
109adantr 484 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐴𝑋)
11 simpr2 1192 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐵𝑋)
1211adantr 484 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐵𝑋)
13 simplr3 1214 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐷𝑋)
14 initoeu2lem.i . . . . . . . 8 𝐼 = (Iso‘𝐶)
1514oveqi 7148 . . . . . . 7 (𝐵𝐼𝐴) = (𝐵(Iso‘𝐶)𝐴)
1615eleq2i 2881 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) ↔ 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1716biimpi 219 . . . . 5 (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
18173ad2ant1 1130 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1918adantl 485 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
20 initoeu2lem.h . . . . . . . 8 𝐻 = (Hom ‘𝐶)
2120oveqi 7148 . . . . . . 7 (𝐵𝐻𝐷) = (𝐵(Hom ‘𝐶)𝐷)
2221eleq2i 2881 . . . . . 6 (𝐺 ∈ (𝐵𝐻𝐷) ↔ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2322biimpi 219 . . . . 5 (𝐺 ∈ (𝐵𝐻𝐷) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
24233ad2ant3 1132 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2524adantl 485 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
26 eqid 2798 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
27 initoeu2lem.o . . . 4 = (comp‘𝐶)
284, 26, 14, 7, 11, 9isohom 17038 . . . . . . . 8 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐵𝐼𝐴) ⊆ (𝐵(Hom ‘𝐶)𝐴))
2928sseld 3914 . . . . . . 7 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3029com12 32 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
31303ad2ant1 1130 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3231impcom 411 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴))
3320oveqi 7148 . . . . . . . 8 (𝐴𝐻𝐷) = (𝐴(Hom ‘𝐶)𝐷)
3433eleq2i 2881 . . . . . . 7 (𝐹 ∈ (𝐴𝐻𝐷) ↔ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3534biimpi 219 . . . . . 6 (𝐹 ∈ (𝐴𝐻𝐷) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
36353ad2ant2 1131 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3736adantl 485 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
384, 26, 27, 8, 12, 10, 13, 32, 37catcocl 16948 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → (𝐹(⟨𝐵, 𝐴 𝐷)𝐾) ∈ (𝐵(Hom ‘𝐶)𝐷))
39 eqid 2798 . . 3 ((𝐵(Inv‘𝐶)𝐴)‘𝐾) = ((𝐵(Inv‘𝐶)𝐴)‘𝐾)
4027oveqi 7148 . . 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 399  w3a 1084   = wceq 1538  wcel 2111  cop 4531  cfv 6324  (class class class)co 7135  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 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  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