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

Theorem initoeu2lem0 16486
Description: Lemma 0 for initoeu2 16489. (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 1051 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))))
2 simp3 1056 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
32eqcomd 2616 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
4 initoeu2lem.x . . 3 𝑋 = (Base‘𝐶)
5 eqid 2610 . . 3 (Inv‘𝐶) = (Inv‘𝐶)
6 initoeu1.c . . . . 5 (𝜑𝐶 ∈ Cat)
76adantr 480 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐶 ∈ Cat)
87adantr 480 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐶 ∈ Cat)
9 simpr1 1060 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐴𝑋)
109adantr 480 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐴𝑋)
11 simpr2 1061 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐵𝑋)
1211adantr 480 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐵𝑋)
13 simplr3 1098 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐷𝑋)
14 initoeu2lem.i . . . . . . . 8 𝐼 = (Iso‘𝐶)
1514oveqi 6562 . . . . . . 7 (𝐵𝐼𝐴) = (𝐵(Iso‘𝐶)𝐴)
1615eleq2i 2680 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) ↔ 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1716biimpi 205 . . . . 5 (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
18173ad2ant1 1075 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1918adantl 481 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
20 initoeu2lem.h . . . . . . . 8 𝐻 = (Hom ‘𝐶)
2120oveqi 6562 . . . . . . 7 (𝐵𝐻𝐷) = (𝐵(Hom ‘𝐶)𝐷)
2221eleq2i 2680 . . . . . 6 (𝐺 ∈ (𝐵𝐻𝐷) ↔ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2322biimpi 205 . . . . 5 (𝐺 ∈ (𝐵𝐻𝐷) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
24233ad2ant3 1077 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2524adantl 481 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
26 eqid 2610 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
27 initoeu2lem.o . . . 4 = (comp‘𝐶)
284, 26, 14, 7, 11, 9isohom 16259 . . . . . . . 8 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐵𝐼𝐴) ⊆ (𝐵(Hom ‘𝐶)𝐴))
2928sseld 3567 . . . . . . 7 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3029com12 32 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
31303ad2ant1 1075 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3231impcom 445 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴))
3320oveqi 6562 . . . . . . . 8 (𝐴𝐻𝐷) = (𝐴(Hom ‘𝐶)𝐷)
3433eleq2i 2680 . . . . . . 7 (𝐹 ∈ (𝐴𝐻𝐷) ↔ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3534biimpi 205 . . . . . 6 (𝐹 ∈ (𝐴𝐻𝐷) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
36353ad2ant2 1076 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3736adantl 481 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
384, 26, 27, 8, 12, 10, 13, 32, 37catcocl 16169 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → (𝐹(⟨𝐵, 𝐴 𝐷)𝐾) ∈ (𝐵(Hom ‘𝐶)𝐷))
39 eqid 2610 . . 3 ((𝐵(Inv‘𝐶)𝐴)‘𝐾) = ((𝐵(Inv‘𝐶)𝐴)‘𝐾)
4027oveqi 6562 . . 3 (⟨𝐴, 𝐵 𝐷) = (⟨𝐴, 𝐵⟩(comp‘𝐶)𝐷)
414, 5, 8, 10, 12, 13, 19, 25, 38, 39, 40rcaninv 16277 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → ((𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾)))
421, 3, 41sylc 63 1 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031   = wceq 1475  wcel 1977  cop 4131  cfv 5804  (class class class)co 6549  Basecbs 15695  Hom chom 15779  compcco 15780  Catccat 16148  Invcinv 16228  Isociso 16229  InitOcinito 16461
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-1st 7059  df-2nd 7060  df-cat 16152  df-cid 16153  df-sect 16230  df-inv 16231  df-iso 16232
This theorem is referenced by:  initoeu2lem1  16487
  Copyright terms: Public domain W3C validator