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

Theorem f1cnvcnv 5589
Description: Two ways to express that a set  A (not necessarily a function) is one-to-one. Each side is equivalent to Definition 6.4(3) of [TakeutiZaring] p. 24, who use the notation "Un2 (A)" for one-to-one. We do not introduce a separate notation since we rarely use it. (Contributed by NM, 13-Aug-2004.)
Assertion
Ref Expression
f1cnvcnv  |-  ( `' `' A : dom  A -1-1-> _V  <->  ( Fun  `' A  /\  Fun  `' `' A ) )

Proof of Theorem f1cnvcnv
StepHypRef Expression
1 df-f1 5362 . 2  |-  ( `' `' A : dom  A -1-1-> _V  <->  ( `' `' A : dom  A --> _V  /\  Fun  `' `' `' A ) )
2 dffn2 5515 . . . 4  |-  ( `' `' A  Fn  dom  A  <->  `' `' A : dom  A --> _V )
3 dmcnvcnv 4986 . . . . 5  |-  dom  `' `' A  =  dom  A
4 df-fn 5360 . . . . 5  |-  ( `' `' A  Fn  dom  A  <-> 
( Fun  `' `' A  /\  dom  `' `' A  =  dom  A ) )
53, 4mpbiran2 950 . . . 4  |-  ( `' `' A  Fn  dom  A  <->  Fun  `' `' A )
62, 5bitr3i 186 . . 3  |-  ( `' `' A : dom  A --> _V 
<->  Fun  `' `' A
)
7 relcnv 5145 . . . . 5  |-  Rel  `' A
8 dfrel2 5218 . . . . 5  |-  ( Rel  `' A  <->  `' `' `' A  =  `' A )
97, 8mpbi 145 . . . 4  |-  `' `' `' A  =  `' A
109funeqi 5378 . . 3  |-  ( Fun  `' `' `' A  <->  Fun  `' A )
116, 10anbi12ci 461 . 2  |-  ( ( `' `' A : dom  A --> _V  /\  Fun  `' `' `' A )  <->  ( Fun  `' A  /\  Fun  `' `' A ) )
121, 11bitri 184 1  |-  ( `' `' A : dom  A -1-1-> _V  <->  ( Fun  `' A  /\  Fun  `' `' A ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    = wceq 1398   _Vcvv 2815   `'ccnv 4753   dom cdm 4754   Rel wrel 4759   Fun wfun 5351    Fn wfn 5352   -->wf 5353   -1-1->wf1 5354
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator