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

Theorem isocoinvid 16805
 Description: The inverse of an isomorphism composed with the isomorphism is the identity. (Contributed by AV, 10-Apr-2020.)
Hypotheses
Ref Expression
invisoinv.b 𝐵 = (Base‘𝐶)
invisoinv.i 𝐼 = (Iso‘𝐶)
invisoinv.n 𝑁 = (Inv‘𝐶)
invisoinv.c (𝜑𝐶 ∈ Cat)
invisoinv.x (𝜑𝑋𝐵)
invisoinv.y (𝜑𝑌𝐵)
invisoinv.f (𝜑𝐹 ∈ (𝑋𝐼𝑌))
invcoisoid.1 1 = (Id‘𝐶)
isocoinvid.o = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
Assertion
Ref Expression
isocoinvid (𝜑 → (𝐹 ((𝑋𝑁𝑌)‘𝐹)) = ( 1𝑌))

Proof of Theorem isocoinvid
StepHypRef Expression
1 invisoinv.b . . . 4 𝐵 = (Base‘𝐶)
2 invisoinv.i . . . 4 𝐼 = (Iso‘𝐶)
3 invisoinv.n . . . 4 𝑁 = (Inv‘𝐶)
4 invisoinv.c . . . 4 (𝜑𝐶 ∈ Cat)
5 invisoinv.x . . . 4 (𝜑𝑋𝐵)
6 invisoinv.y . . . 4 (𝜑𝑌𝐵)
7 invisoinv.f . . . 4 (𝜑𝐹 ∈ (𝑋𝐼𝑌))
81, 2, 3, 4, 5, 6, 7invisoinvl 16802 . . 3 (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹)
9 eqid 2825 . . . . 5 (Sect‘𝐶) = (Sect‘𝐶)
101, 3, 4, 6, 5, 9isinv 16772 . . . 4 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹 ↔ (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹))))
11 simpl 476 . . . 4 ((((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹𝐹(𝑋(Sect‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
1210, 11syl6bi 245 . . 3 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌𝑁𝑋)𝐹 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹))
138, 12mpd 15 . 2 (𝜑 → ((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹)
14 eqid 2825 . . . 4 (Hom ‘𝐶) = (Hom ‘𝐶)
15 eqid 2825 . . . 4 (comp‘𝐶) = (comp‘𝐶)
16 invcoisoid.1 . . . 4 1 = (Id‘𝐶)
171, 14, 2, 4, 6, 5isohom 16788 . . . . 5 (𝜑 → (𝑌𝐼𝑋) ⊆ (𝑌(Hom ‘𝐶)𝑋))
181, 3, 4, 5, 6, 2invf 16780 . . . . . 6 (𝜑 → (𝑋𝑁𝑌):(𝑋𝐼𝑌)⟶(𝑌𝐼𝑋))
1918, 7ffvelrnd 6609 . . . . 5 (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌𝐼𝑋))
2017, 19sseldd 3828 . . . 4 (𝜑 → ((𝑋𝑁𝑌)‘𝐹) ∈ (𝑌(Hom ‘𝐶)𝑋))
211, 14, 2, 4, 5, 6isohom 16788 . . . . 5 (𝜑 → (𝑋𝐼𝑌) ⊆ (𝑋(Hom ‘𝐶)𝑌))
2221, 7sseldd 3828 . . . 4 (𝜑𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌))
231, 14, 15, 16, 9, 4, 6, 5, 20, 22issect2 16766 . . 3 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ↔ (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = ( 1𝑌)))
24 isocoinvid.o . . . . . . 7 = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)
2524a1i 11 . . . . . 6 (𝜑 = (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌))
2625eqcomd 2831 . . . . 5 (𝜑 → (⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌) = )
2726oveqd 6922 . . . 4 (𝜑 → (𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = (𝐹 ((𝑋𝑁𝑌)‘𝐹)))
2827eqeq1d 2827 . . 3 (𝜑 → ((𝐹(⟨𝑌, 𝑋⟩(comp‘𝐶)𝑌)((𝑋𝑁𝑌)‘𝐹)) = ( 1𝑌) ↔ (𝐹 ((𝑋𝑁𝑌)‘𝐹)) = ( 1𝑌)))
2923, 28bitrd 271 . 2 (𝜑 → (((𝑋𝑁𝑌)‘𝐹)(𝑌(Sect‘𝐶)𝑋)𝐹 ↔ (𝐹 ((𝑋𝑁𝑌)‘𝐹)) = ( 1𝑌)))
3013, 29mpbid 224 1 (𝜑 → (𝐹 ((𝑋𝑁𝑌)‘𝐹)) = ( 1𝑌))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 386   = wceq 1658   ∈ wcel 2166  ⟨cop 4403   class class class wbr 4873  ‘cfv 6123  (class class class)co 6905  Basecbs 16222  Hom chom 16316  compcco 16317  Catccat 16677  Idccid 16678  Sectcsect 16756  Invcinv 16757  Isociso 16758 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1896  ax-4 1910  ax-5 2011  ax-6 2077  ax-7 2114  ax-8 2168  ax-9 2175  ax-10 2194  ax-11 2209  ax-12 2222  ax-13 2391  ax-ext 2803  ax-rep 4994  ax-sep 5005  ax-nul 5013  ax-pow 5065  ax-pr 5127  ax-un 7209 This theorem depends on definitions:  df-bi 199  df-an 387  df-or 881  df-3an 1115  df-tru 1662  df-ex 1881  df-nf 1885  df-sb 2070  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rmo 3125  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-iun 4742  df-br 4874  df-opab 4936  df-mpt 4953  df-id 5250  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-rn 5353  df-res 5354  df-ima 5355  df-iota 6086  df-fun 6125  df-fn 6126  df-f 6127  df-f1 6128  df-fo 6129  df-f1o 6130  df-fv 6131  df-riota 6866  df-ov 6908  df-oprab 6909  df-mpt2 6910  df-1st 7428  df-2nd 7429  df-cat 16681  df-cid 16682  df-sect 16759  df-inv 16760  df-iso 16761 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator