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

Theorem f1ocnv2d 5724
Description: Describe an implicit one-to-one onto function. (Contributed by Mario Carneiro, 30-Apr-2015.)
Hypotheses
Ref Expression
f1od.1  |-  F  =  ( x  e.  A  |->  C )
f1o2d.2  |-  ( (
ph  /\  x  e.  A )  ->  C  e.  B )
f1o2d.3  |-  ( (
ph  /\  y  e.  B )  ->  D  e.  A )
f1o2d.4  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  B ) )  -> 
( x  =  D  <-> 
y  =  C ) )
Assertion
Ref Expression
f1ocnv2d  |-  ( ph  ->  ( F : A -1-1-onto-> B  /\  `' F  =  (
y  e.  B  |->  D ) ) )
Distinct variable groups:    x, y, A   
x, B, y    y, C    x, D    ph, x, y
Allowed substitution hints:    C( x)    D( y)    F( x, y)

Proof of Theorem f1ocnv2d
StepHypRef Expression
1 f1od.1 . 2  |-  F  =  ( x  e.  A  |->  C )
2 f1o2d.2 . 2  |-  ( (
ph  /\  x  e.  A )  ->  C  e.  B )
3 f1o2d.3 . 2  |-  ( (
ph  /\  y  e.  B )  ->  D  e.  A )
4 eleq1a 2150 . . . . . 6  |-  ( C  e.  B  ->  (
y  =  C  -> 
y  e.  B ) )
52, 4syl 14 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  (
y  =  C  -> 
y  e.  B ) )
65impr 371 . . . 4  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
y  e.  B )
7 f1o2d.4 . . . . . . . 8  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  B ) )  -> 
( x  =  D  <-> 
y  =  C ) )
87biimpar 291 . . . . . . 7  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  B )
)  /\  y  =  C )  ->  x  =  D )
98exp42 363 . . . . . 6  |-  ( ph  ->  ( x  e.  A  ->  ( y  e.  B  ->  ( y  =  C  ->  x  =  D ) ) ) )
109com34 82 . . . . 5  |-  ( ph  ->  ( x  e.  A  ->  ( y  =  C  ->  ( y  e.  B  ->  x  =  D ) ) ) )
1110imp32 253 . . . 4  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
( y  e.  B  ->  x  =  D ) )
126, 11jcai 304 . . 3  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
( y  e.  B  /\  x  =  D
) )
13 eleq1a 2150 . . . . . 6  |-  ( D  e.  A  ->  (
x  =  D  ->  x  e.  A )
)
143, 13syl 14 . . . . 5  |-  ( (
ph  /\  y  e.  B )  ->  (
x  =  D  ->  x  e.  A )
)
1514impr 371 . . . 4  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  ->  x  e.  A )
167biimpa 290 . . . . . . . 8  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  B )
)  /\  x  =  D )  ->  y  =  C )
1716exp42 363 . . . . . . 7  |-  ( ph  ->  ( x  e.  A  ->  ( y  e.  B  ->  ( x  =  D  ->  y  =  C ) ) ) )
1817com23 77 . . . . . 6  |-  ( ph  ->  ( y  e.  B  ->  ( x  e.  A  ->  ( x  =  D  ->  y  =  C ) ) ) )
1918com34 82 . . . . 5  |-  ( ph  ->  ( y  e.  B  ->  ( x  =  D  ->  ( x  e.  A  ->  y  =  C ) ) ) )
2019imp32 253 . . . 4  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  -> 
( x  e.  A  ->  y  =  C ) )
2115, 20jcai 304 . . 3  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  -> 
( x  e.  A  /\  y  =  C
) )
2212, 21impbida 560 . 2  |-  ( ph  ->  ( ( x  e.  A  /\  y  =  C )  <->  ( y  e.  B  /\  x  =  D ) ) )
231, 2, 3, 22f1ocnvd 5722 1  |-  ( ph  ->  ( F : A -1-1-onto-> B  /\  `' F  =  (
y  e.  B  |->  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284    e. wcel 1433    |-> cmpt 3839   `'ccnv 4362   -1-1-onto->wf1o 4921
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929
This theorem is referenced by:  f1o2d  5725  negf1o  7486  negiso  8033  iccf1o  9026
  Copyright terms: Public domain W3C validator