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

Theorem invf1o 17712
Description: The inverse relation is a bijection from isomorphisms to isomorphisms. This means that every isomorphism 𝐹 ∈ (π‘‹πΌπ‘Œ) has a unique inverse, denoted by ((Invβ€˜πΆ)β€˜πΉ). Remark 3.12 of [Adamek] p. 28. (Contributed by Mario Carneiro, 2-Jan-2017.)
Hypotheses
Ref Expression
invfval.b 𝐡 = (Baseβ€˜πΆ)
invfval.n 𝑁 = (Invβ€˜πΆ)
invfval.c (πœ‘ β†’ 𝐢 ∈ Cat)
invfval.x (πœ‘ β†’ 𝑋 ∈ 𝐡)
invfval.y (πœ‘ β†’ π‘Œ ∈ 𝐡)
isoval.n 𝐼 = (Isoβ€˜πΆ)
Assertion
Ref Expression
invf1o (πœ‘ β†’ (π‘‹π‘π‘Œ):(π‘‹πΌπ‘Œ)–1-1-ontoβ†’(π‘ŒπΌπ‘‹))

Proof of Theorem invf1o
StepHypRef Expression
1 invfval.b . . . 4 𝐡 = (Baseβ€˜πΆ)
2 invfval.n . . . 4 𝑁 = (Invβ€˜πΆ)
3 invfval.c . . . 4 (πœ‘ β†’ 𝐢 ∈ Cat)
4 invfval.x . . . 4 (πœ‘ β†’ 𝑋 ∈ 𝐡)
5 invfval.y . . . 4 (πœ‘ β†’ π‘Œ ∈ 𝐡)
6 isoval.n . . . 4 𝐼 = (Isoβ€˜πΆ)
71, 2, 3, 4, 5, 6invf 17711 . . 3 (πœ‘ β†’ (π‘‹π‘π‘Œ):(π‘‹πΌπ‘Œ)⟢(π‘ŒπΌπ‘‹))
87ffnd 6715 . 2 (πœ‘ β†’ (π‘‹π‘π‘Œ) Fn (π‘‹πΌπ‘Œ))
91, 2, 3, 5, 4, 6invf 17711 . . . 4 (πœ‘ β†’ (π‘Œπ‘π‘‹):(π‘ŒπΌπ‘‹)⟢(π‘‹πΌπ‘Œ))
109ffnd 6715 . . 3 (πœ‘ β†’ (π‘Œπ‘π‘‹) Fn (π‘ŒπΌπ‘‹))
111, 2, 3, 4, 5invsym2 17706 . . . 4 (πœ‘ β†’ β—‘(π‘‹π‘π‘Œ) = (π‘Œπ‘π‘‹))
1211fneq1d 6639 . . 3 (πœ‘ β†’ (β—‘(π‘‹π‘π‘Œ) Fn (π‘ŒπΌπ‘‹) ↔ (π‘Œπ‘π‘‹) Fn (π‘ŒπΌπ‘‹)))
1310, 12mpbird 257 . 2 (πœ‘ β†’ β—‘(π‘‹π‘π‘Œ) Fn (π‘ŒπΌπ‘‹))
14 dff1o4 6838 . 2 ((π‘‹π‘π‘Œ):(π‘‹πΌπ‘Œ)–1-1-ontoβ†’(π‘ŒπΌπ‘‹) ↔ ((π‘‹π‘π‘Œ) Fn (π‘‹πΌπ‘Œ) ∧ β—‘(π‘‹π‘π‘Œ) Fn (π‘ŒπΌπ‘‹)))
158, 13, 14sylanbrc 584 1 (πœ‘ β†’ (π‘‹π‘π‘Œ):(π‘‹πΌπ‘Œ)–1-1-ontoβ†’(π‘ŒπΌπ‘‹))
Colors of variables: wff setvar class
Syntax hints:   β†’ wi 4   = wceq 1542   ∈ wcel 2107  β—‘ccnv 5674   Fn wfn 6535  β€“1-1-ontoβ†’wf1o 6539  β€˜cfv 6540  (class class class)co 7404  Basecbs 17140  Catccat 17604  Invcinv 17688  Isociso 17689
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7720
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rmo 3377  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7360  df-ov 7407  df-oprab 7408  df-mpo 7409  df-1st 7970  df-2nd 7971  df-cat 17608  df-cid 17609  df-sect 17690  df-inv 17691  df-iso 17692
This theorem is referenced by:  invinv  17713
  Copyright terms: Public domain W3C validator