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

Theorem initoeu2lem0 17975
Description: Lemma 0 for initoeu2 17978. (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 1148 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))))
2 simp3 1138 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
32eqcomd 2735 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
4 initoeu2lem.x . . 3 𝑋 = (Base‘𝐶)
5 eqid 2729 . . 3 (Inv‘𝐶) = (Inv‘𝐶)
6 initoeu1.c . . . . 5 (𝜑𝐶 ∈ Cat)
76adantr 480 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐶 ∈ Cat)
87adantr 480 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐶 ∈ Cat)
9 simpr1 1195 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐴𝑋)
109adantr 480 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐴𝑋)
11 simpr2 1196 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐵𝑋)
1211adantr 480 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐵𝑋)
13 simplr3 1218 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐷𝑋)
14 initoeu2lem.i . . . . . . . 8 𝐼 = (Iso‘𝐶)
1514oveqi 7400 . . . . . . 7 (𝐵𝐼𝐴) = (𝐵(Iso‘𝐶)𝐴)
1615eleq2i 2820 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) ↔ 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1716biimpi 216 . . . . 5 (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
18173ad2ant1 1133 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1918adantl 481 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
20 initoeu2lem.h . . . . . . . 8 𝐻 = (Hom ‘𝐶)
2120oveqi 7400 . . . . . . 7 (𝐵𝐻𝐷) = (𝐵(Hom ‘𝐶)𝐷)
2221eleq2i 2820 . . . . . 6 (𝐺 ∈ (𝐵𝐻𝐷) ↔ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2322biimpi 216 . . . . 5 (𝐺 ∈ (𝐵𝐻𝐷) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
24233ad2ant3 1135 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2524adantl 481 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
26 eqid 2729 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
27 initoeu2lem.o . . . 4 = (comp‘𝐶)
284, 26, 14, 7, 11, 9isohom 17738 . . . . . . . 8 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐵𝐼𝐴) ⊆ (𝐵(Hom ‘𝐶)𝐴))
2928sseld 3945 . . . . . . 7 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3029com12 32 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
31303ad2ant1 1133 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3231impcom 407 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴))
3320oveqi 7400 . . . . . . . 8 (𝐴𝐻𝐷) = (𝐴(Hom ‘𝐶)𝐷)
3433eleq2i 2820 . . . . . . 7 (𝐹 ∈ (𝐴𝐻𝐷) ↔ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3534biimpi 216 . . . . . 6 (𝐹 ∈ (𝐴𝐻𝐷) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
36353ad2ant2 1134 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3736adantl 481 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
384, 26, 27, 8, 12, 10, 13, 32, 37catcocl 17646 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → (𝐹(⟨𝐵, 𝐴 𝐷)𝐾) ∈ (𝐵(Hom ‘𝐶)𝐷))
39 eqid 2729 . . 3 ((𝐵(Inv‘𝐶)𝐴)‘𝐾) = ((𝐵(Inv‘𝐶)𝐴)‘𝐾)
4027oveqi 7400 . . 3 (⟨𝐴, 𝐵 𝐷) = (⟨𝐴, 𝐵⟩(comp‘𝐶)𝐷)
414, 5, 8, 10, 12, 13, 19, 25, 38, 39, 40rcaninv 17756 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → ((𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾)))
421, 3, 41sylc 65 1 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  cop 4595  cfv 6511  (class class class)co 7387  Basecbs 17179  Hom chom 17231  compcco 17232  Catccat 17625  Invcinv 17707  Isociso 17708  InitOcinito 17943
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-1st 7968  df-2nd 7969  df-cat 17629  df-cid 17630  df-sect 17709  df-inv 17710  df-iso 17711
This theorem is referenced by:  initoeu2lem1  17976
  Copyright terms: Public domain W3C validator