ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1ocnv Unicode version

Theorem f1ocnv 5596
Description: The converse of a one-to-one onto function is also one-to-one onto. (Contributed by NM, 11-Feb-1997.) (Proof shortened by Andrew Salmon, 22-Oct-2011.)
Assertion
Ref Expression
f1ocnv  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )

Proof of Theorem f1ocnv
StepHypRef Expression
1 fnrel 5428 . . . . 5  |-  ( F  Fn  A  ->  Rel  F )
2 dfrel2 5187 . . . . . 6  |-  ( Rel 
F  <->  `' `' F  =  F
)
3 fneq1 5418 . . . . . . 7  |-  ( `' `' F  =  F  ->  ( `' `' F  Fn  A  <->  F  Fn  A
) )
43biimprd 158 . . . . . 6  |-  ( `' `' F  =  F  ->  ( F  Fn  A  ->  `' `' F  Fn  A
) )
52, 4sylbi 121 . . . . 5  |-  ( Rel 
F  ->  ( F  Fn  A  ->  `' `' F  Fn  A )
)
61, 5mpcom 36 . . . 4  |-  ( F  Fn  A  ->  `' `' F  Fn  A
)
76anim2i 342 . . 3  |-  ( ( `' F  Fn  B  /\  F  Fn  A
)  ->  ( `' F  Fn  B  /\  `' `' F  Fn  A
) )
87ancoms 268 . 2  |-  ( ( F  Fn  A  /\  `' F  Fn  B
)  ->  ( `' F  Fn  B  /\  `' `' F  Fn  A
) )
9 dff1o4 5591 . 2  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
10 dff1o4 5591 . 2  |-  ( `' F : B -1-1-onto-> A  <->  ( `' F  Fn  B  /\  `' `' F  Fn  A
) )
118, 9, 103imtr4i 201 1  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1397   `'ccnv 4724   Rel wrel 4730    Fn wfn 5321   -1-1-onto->wf1o 5325
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333
This theorem is referenced by:  f1ocnvb  5597  f1orescnv  5599  f1imacnv  5600  f1cnv  5607  f1ococnv1  5612  f1oresrab  5812  f1ocnvfv2  5919  f1ocnvdm  5922  f1ocnvfvrneq  5923  fcof1o  5930  isocnv  5952  f1ofveu  6006  mapsnf1o3  6866  ener  6953  en0  6969  en1  6973  en2  6998  mapen  7032  ssenen  7037  preimaf1ofi  7150  ordiso2  7234  caseinl  7290  caseinr  7291  ctssdccl  7310  ctssdclemr  7311  enomnilem  7337  enmkvlem  7360  enwomnilem  7368  cc3  7487  fnn0nninf  10700  0tonninf  10702  1tonninf  10703  iseqf1olemkle  10759  iseqf1olemklt  10760  iseqf1olemqcl  10761  iseqf1olemnab  10763  iseqf1olemmo  10767  iseqf1olemqk  10769  seq3f1olemqsumkj  10773  seq3f1olemqsumk  10774  seq3f1olemstep  10776  seqf1oglem1  10781  seqf1oglem2  10782  hashfz1  11045  hashfacen  11100  seq3coll  11106  cnrecnv  11471  nnf1o  11938  summodclem3  11942  summodclem2a  11943  prodmodclem3  12137  prodmodclem2a  12138  fprodssdc  12152  sqpweven  12748  2sqpwodd  12749  phimullem  12798  eulerthlemh  12804  1arith2  12942  xpnnen  13016  ennnfonelemjn  13024  ennnfonelemp1  13028  ennnfonelemhdmp1  13031  ennnfonelemss  13032  ennnfonelemkh  13034  ennnfonelemhf1o  13035  ennnfonelemex  13036  ennnfonelemf1  13040  ennnfonelemnn0  13044  ennnfonelemim  13046  ctinfomlemom  13049  ctiunctlemfo  13061  ssnnctlemct  13068  mhmf1o  13554  ghmf1o  13863  gsumfzreidx  13925  znleval  14669  txhmeo  15045  dfrelog  15586  relogf1o  15587  012of  16595  domomsubct  16605  exmidsbthrlem  16629  iswomninnlem  16656  gfsumval  16683
  Copyright terms: Public domain W3C validator