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

Theorem f1ocnv 5650
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 5477 . . . . 5  |-  ( F  Fn  A  ->  Rel  F )
2 dfrel2 5236 . . . . . 6  |-  ( Rel 
F  <->  `' `' F  =  F
)
3 fneq1 5467 . . . . . . 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 5645 . 2  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
10 dff1o4 5645 . 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 1402   `'ccnv 4771   Rel wrel 4777    Fn wfn 5370   -1-1-onto->wf1o 5374
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-pow 4309  ax-pr 4344
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-br 4129  df-opab 4191  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382
This theorem is referenced by:  f1ocnvb  5651  f1orescnv  5653  f1imacnv  5654  f1cnv  5661  f1ococnv1  5666  f1oresrab  5867  f1ocnvfv2  5977  f1ocnvdm  5980  f1ocnvfvrneq  5981  fcof1o  5988  isocnv  6010  f1ofveu  6066  mapsnf1o3  6972  ener  7059  en0  7075  en1  7079  en2  7105  mapen  7139  ssenen  7145  preimaf1ofi  7261  ordiso2  7368  caseinl  7424  caseinr  7425  ctssdccl  7444  ctssdclemr  7445  enomnilem  7471  enmkvlem  7494  enwomnilem  7502  cc3  7627  fnn0nninf  10856  0tonninf  10858  1tonninf  10859  iseqf1olemkle  10915  iseqf1olemklt  10916  iseqf1olemqcl  10917  iseqf1olemnab  10919  iseqf1olemmo  10923  iseqf1olemqk  10925  seq3f1olemqsumkj  10929  seq3f1olemqsumk  10930  seq3f1olemstep  10932  seqf1oglem1  10937  seqf1oglem2  10938  hashfz1  11203  hashfacen  11265  seq3coll  11275  cnrecnv  11657  nnf1o  12124  summodclem3  12128  summodclem2a  12129  prodmodclem3  12323  prodmodclem2a  12324  fprodssdc  12338  sqpweven  12934  2sqpwodd  12935  phimullem  12984  eulerthlemh  12990  1arith2  13128  xpnnen  13266  ennnfonelemjn  13274  ennnfonelemp1  13278  ennnfonelemhdmp1  13281  ennnfonelemss  13282  ennnfonelemkh  13284  ennnfonelemhf1o  13285  ennnfonelemex  13286  ennnfonelemf1  13290  ennnfonelemnn0  13294  ennnfonelemim  13296  ctinfomlemom  13299  ctiunctlemfo  13311  ssnnctlemct  13318  mhmf1o  13757  ghmf1o  14058  gzsumreidx  14121  gsumvalfi  14132  gsumf1ofi  14140  znleval  14963  txhmeo  15346  dfrelog  15887  relogf1o  15888  012of  16940  domomsubct  16948  exmidsbthrlem  16975  iswomninnlem  17007
  Copyright terms: Public domain W3C validator