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

Theorem initoeu2lem0 18094
Description: Lemma 0 for initoeu2 18097. (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 1166 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))))
2 simp3 1156 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
32eqcomd 2771 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)))
4 initoeu2lem.x . . 3 𝑋 = (Base‘𝐶)
5 eqid 2765 . . 3 (Inv‘𝐶) = (Inv‘𝐶)
6 initoeu1.c . . . . 5 (𝜑𝐶 ∈ Cat)
76adantr 486 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐶 ∈ Cat)
87adantr 486 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐶 ∈ Cat)
9 simpr1 1213 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐴𝑋)
109adantr 486 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐴𝑋)
11 simpr2 1214 . . . 4 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐵𝑋)
1211adantr 486 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐵𝑋)
13 simplr3 1236 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐷𝑋)
14 initoeu2lem.i . . . . . . . 8 𝐼 = (Iso‘𝐶)
1514oveqi 7432 . . . . . . 7 (𝐵𝐼𝐴) = (𝐵(Iso‘𝐶)𝐴)
1615eleq2i 2857 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) ↔ 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1716biimpi 219 . . . . 5 (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
18173ad2ant1 1151 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
1918adantl 487 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Iso‘𝐶)𝐴))
20 initoeu2lem.h . . . . . . . 8 𝐻 = (Hom ‘𝐶)
2120oveqi 7432 . . . . . . 7 (𝐵𝐻𝐷) = (𝐵(Hom ‘𝐶)𝐷)
2221eleq2i 2857 . . . . . 6 (𝐺 ∈ (𝐵𝐻𝐷) ↔ 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2322biimpi 219 . . . . 5 (𝐺 ∈ (𝐵𝐻𝐷) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
24233ad2ant3 1153 . . . 4 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
2524adantl 487 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐺 ∈ (𝐵(Hom ‘𝐶)𝐷))
26 eqid 2765 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
27 initoeu2lem.o . . . 4 = (comp‘𝐶)
284, 26, 14, 7, 11, 9isohom 17857 . . . . . . . 8 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐵𝐼𝐴) ⊆ (𝐵(Hom ‘𝐶)𝐴))
2928sseld 3937 . . . . . . 7 ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → (𝐾 ∈ (𝐵𝐼𝐴) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3029com12 33 . . . . . 6 (𝐾 ∈ (𝐵𝐼𝐴) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
31303ad2ant1 1151 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → ((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴)))
3231impcom 413 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐾 ∈ (𝐵(Hom ‘𝐶)𝐴))
3320oveqi 7432 . . . . . . . 8 (𝐴𝐻𝐷) = (𝐴(Hom ‘𝐶)𝐷)
3433eleq2i 2857 . . . . . . 7 (𝐹 ∈ (𝐴𝐻𝐷) ↔ 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3534biimpi 219 . . . . . 6 (𝐹 ∈ (𝐴𝐻𝐷) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
36353ad2ant2 1152 . . . . 5 ((𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
3736adantl 487 . . . 4 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → 𝐹 ∈ (𝐴(Hom ‘𝐶)𝐷))
384, 26, 27, 8, 12, 10, 13, 32, 37catcocl 17765 . . 3 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → (𝐹(⟨𝐵, 𝐴 𝐷)𝐾) ∈ (𝐵(Hom ‘𝐶)𝐷))
39 eqid 2765 . . 3 ((𝐵(Inv‘𝐶)𝐴)‘𝐾) = ((𝐵(Inv‘𝐶)𝐴)‘𝐾)
4027oveqi 7432 . . 3 (⟨𝐴, 𝐵 𝐷) = (⟨𝐴, 𝐵⟩(comp‘𝐶)𝐷)
414, 5, 8, 10, 12, 13, 19, 25, 38, 39, 40rcaninv 17875 . 2 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷))) → ((𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾)))
421, 3, 41sylc 66 1 (((𝜑 ∧ (𝐴𝑋𝐵𝑋𝐷𝑋)) ∧ (𝐾 ∈ (𝐵𝐼𝐴) ∧ 𝐹 ∈ (𝐴𝐻𝐷) ∧ 𝐺 ∈ (𝐵𝐻𝐷)) ∧ ((𝐹(⟨𝐵, 𝐴 𝐷)𝐾)(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾)) = (𝐺(⟨𝐴, 𝐵 𝐷)((𝐵(Inv‘𝐶)𝐴)‘𝐾))) → 𝐺 = (𝐹(⟨𝐵, 𝐴 𝐷)𝐾))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2146  cop 4597  cfv 6540  (class class class)co 7419  Basecbs 17293  Hom chom 17345  compcco 17346  Catccat 17744  Invcinv 17826  Isociso 17827  InitOcinito 18062
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-cat 17748  df-cid 17749  df-sect 17828  df-inv 17829  df-iso 17830
This theorem is used by:  initoeu2lem1  18095
  Copyright terms: Public domain W3C validator