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

Theorem rcaninv 17730
Description: Right cancellation of an inverse of an isomorphism. (Contributed by AV, 5-Apr-2020.)
Hypotheses
Ref Expression
rcaninv.b 𝐵 = (Base‘𝐶)
rcaninv.n 𝑁 = (Inv‘𝐶)
rcaninv.c (𝜑𝐶 ∈ Cat)
rcaninv.x (𝜑𝑋𝐵)
rcaninv.y (𝜑𝑌𝐵)
rcaninv.z (𝜑𝑍𝐵)
rcaninv.f (𝜑𝐹 ∈ (𝑌(Iso‘𝐶)𝑋))
rcaninv.g (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑍))
rcaninv.h (𝜑𝐻 ∈ (𝑌(Hom ‘𝐶)𝑍))
rcaninv.1 𝑅 = ((𝑌𝑁𝑋)‘𝐹)
rcaninv.o = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)
Assertion
Ref Expression
rcaninv (𝜑 → ((𝐺 𝑅) = (𝐻 𝑅) → 𝐺 = 𝐻))

Proof of Theorem rcaninv
StepHypRef Expression
1 rcaninv.b . . . . . 6 𝐵 = (Base‘𝐶)
2 eqid 2737 . . . . . 6 (Hom ‘𝐶) = (Hom ‘𝐶)
3 eqid 2737 . . . . . 6 (comp‘𝐶) = (comp‘𝐶)
4 rcaninv.c . . . . . 6 (𝜑𝐶 ∈ Cat)
5 rcaninv.y . . . . . 6 (𝜑𝑌𝐵)
6 rcaninv.x . . . . . 6 (𝜑𝑋𝐵)
7 eqid 2737 . . . . . . . 8 (Iso‘𝐶) = (Iso‘𝐶)
81, 2, 7, 4, 5, 6isohom 17712 . . . . . . 7 (𝜑 → (𝑌(Iso‘𝐶)𝑋) ⊆ (𝑌(Hom ‘𝐶)𝑋))
9 rcaninv.f . . . . . . 7 (𝜑𝐹 ∈ (𝑌(Iso‘𝐶)𝑋))
108, 9sseldd 3936 . . . . . 6 (𝜑𝐹 ∈ (𝑌(Hom ‘𝐶)𝑋))
111, 2, 7, 4, 6, 5isohom 17712 . . . . . . 7 (𝜑 → (𝑋(Iso‘𝐶)𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
12 rcaninv.n . . . . . . . . 9 𝑁 = (Inv‘𝐶)
131, 12, 4, 5, 6, 7invf 17704 . . . . . . . 8 (𝜑 → (𝑌𝑁𝑋):(𝑌(Iso‘𝐶)𝑋)⟶(𝑋(Iso‘𝐶)𝑌))
1413, 9ffvelcdmd 7039 . . . . . . 7 (𝜑 → ((𝑌𝑁𝑋)‘𝐹) ∈ (𝑋(Iso‘𝐶)𝑌))
1511, 14sseldd 3936 . . . . . 6 (𝜑 → ((𝑌𝑁𝑋)‘𝐹) ∈ (𝑋(Hom ‘𝐶)𝑌))
16 rcaninv.z . . . . . 6 (𝜑𝑍𝐵)
17 rcaninv.g . . . . . 6 (𝜑𝐺 ∈ (𝑌(Hom ‘𝐶)𝑍))
181, 2, 3, 4, 5, 6, 5, 10, 15, 16, 17catass 17621 . . . . 5 (𝜑 → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹))(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = (𝐺(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)))
19 eqid 2737 . . . . . . . 8 (Id‘𝐶) = (Id‘𝐶)
20 eqid 2737 . . . . . . . 8 (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌) = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
211, 7, 12, 4, 5, 6, 9, 19, 20invcoisoid 17728 . . . . . . 7 (𝜑 → (((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = ((Id‘𝐶)‘𝑌))
2221eqcomd 2743 . . . . . 6 (𝜑 → ((Id‘𝐶)‘𝑌) = (((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹))
2322oveq2d 7384 . . . . 5 (𝜑 → (𝐺(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)((Id‘𝐶)‘𝑌)) = (𝐺(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)))
241, 2, 19, 4, 5, 3, 16, 17catrid 17619 . . . . 5 (𝜑 → (𝐺(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)((Id‘𝐶)‘𝑌)) = 𝐺)
2518, 23, 243eqtr2rd 2779 . . . 4 (𝜑𝐺 = ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹))(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹))
2625adantr 480 . . 3 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → 𝐺 = ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹))(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹))
27 rcaninv.o . . . . . . . . 9 = (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)
2827eqcomi 2746 . . . . . . . 8 (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍) =
2928a1i 11 . . . . . . 7 (𝜑 → (⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍) = )
30 eqidd 2738 . . . . . . 7 (𝜑𝐺 = 𝐺)
31 rcaninv.1 . . . . . . . . 9 𝑅 = ((𝑌𝑁𝑋)‘𝐹)
3231eqcomi 2746 . . . . . . . 8 ((𝑌𝑁𝑋)‘𝐹) = 𝑅
3332a1i 11 . . . . . . 7 (𝜑 → ((𝑌𝑁𝑋)‘𝐹) = 𝑅)
3429, 30, 33oveq123d 7389 . . . . . 6 (𝜑 → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹)) = (𝐺 𝑅))
3534adantr 480 . . . . 5 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹)) = (𝐺 𝑅))
36 simpr 484 . . . . 5 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → (𝐺 𝑅) = (𝐻 𝑅))
3735, 36eqtrd 2772 . . . 4 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹)) = (𝐻 𝑅))
3837oveq1d 7383 . . 3 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)((𝑌𝑁𝑋)‘𝐹))(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = ((𝐻 𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹))
3927oveqi 7381 . . . . . . 7 (𝐻 𝑅) = (𝐻(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)𝑅)
4039oveq1i 7378 . . . . . 6 ((𝐻 𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = ((𝐻(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹)
4140a1i 11 . . . . 5 (𝜑 → ((𝐻 𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = ((𝐻(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹))
4231, 15eqeltrid 2841 . . . . . . 7 (𝜑𝑅 ∈ (𝑋(Hom ‘𝐶)𝑌))
43 rcaninv.h . . . . . . 7 (𝜑𝐻 ∈ (𝑌(Hom ‘𝐶)𝑍))
441, 2, 3, 4, 5, 6, 5, 10, 42, 16, 43catass 17621 . . . . . 6 (𝜑 → ((𝐻(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(𝑅(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)))
4531oveq1i 7378 . . . . . . . 8 (𝑅(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹) = (((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)
4645oveq2i 7379 . . . . . . 7 (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(𝑅(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)) = (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹))
4746a1i 11 . . . . . 6 (𝜑 → (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(𝑅(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)) = (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)))
4821oveq2d 7384 . . . . . 6 (𝜑 → (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)(((𝑌𝑁𝑋)‘𝐹)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)𝐹)) = (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)((Id‘𝐶)‘𝑌)))
4944, 47, 483eqtrd 2776 . . . . 5 (𝜑 → ((𝐻(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑍)𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)((Id‘𝐶)‘𝑌)))
501, 2, 19, 4, 5, 3, 16, 43catrid 17619 . . . . 5 (𝜑 → (𝐻(⟨𝑌, 𝑌⟩(comp‘𝐶)𝑍)((Id‘𝐶)‘𝑌)) = 𝐻)
5141, 49, 503eqtrd 2776 . . . 4 (𝜑 → ((𝐻 𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = 𝐻)
5251adantr 480 . . 3 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → ((𝐻 𝑅)(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑍)𝐹) = 𝐻)
5326, 38, 523eqtrd 2776 . 2 ((𝜑 ∧ (𝐺 𝑅) = (𝐻 𝑅)) → 𝐺 = 𝐻)
5453ex 412 1 (𝜑 → ((𝐺 𝑅) = (𝐻 𝑅) → 𝐺 = 𝐻))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  cop 4588  cfv 6500  (class class class)co 7368  Basecbs 17148  Hom chom 17200  compcco 17201  Catccat 17599  Idccid 17600  Invcinv 17681  Isociso 17682
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1st 7943  df-2nd 7944  df-cat 17603  df-cid 17604  df-sect 17683  df-inv 17684  df-iso 17685
This theorem is referenced by:  initoeu2lem0  17949
  Copyright terms: Public domain W3C validator