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

Theorem f1ocnv2d 6053
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 2242 . . . . . 6  |-  ( C  e.  B  ->  (
y  =  C  -> 
y  e.  B ) )
52, 4syl 14 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  (
y  =  C  -> 
y  e.  B ) )
65impr 377 . . . 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 295 . . . . . . 7  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  B )
)  /\  y  =  C )  ->  x  =  D )
98exp42 369 . . . . . 6  |-  ( ph  ->  ( x  e.  A  ->  ( y  e.  B  ->  ( y  =  C  ->  x  =  D ) ) ) )
109com34 83 . . . . 5  |-  ( ph  ->  ( x  e.  A  ->  ( y  =  C  ->  ( y  e.  B  ->  x  =  D ) ) ) )
1110imp32 255 . . . 4  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
( y  e.  B  ->  x  =  D ) )
126, 11jcai 309 . . 3  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
( y  e.  B  /\  x  =  D
) )
13 eleq1a 2242 . . . . . 6  |-  ( D  e.  A  ->  (
x  =  D  ->  x  e.  A )
)
143, 13syl 14 . . . . 5  |-  ( (
ph  /\  y  e.  B )  ->  (
x  =  D  ->  x  e.  A )
)
1514impr 377 . . . 4  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  ->  x  e.  A )
167biimpa 294 . . . . . . . 8  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  B )
)  /\  x  =  D )  ->  y  =  C )
1716exp42 369 . . . . . . 7  |-  ( ph  ->  ( x  e.  A  ->  ( y  e.  B  ->  ( x  =  D  ->  y  =  C ) ) ) )
1817com23 78 . . . . . 6  |-  ( ph  ->  ( y  e.  B  ->  ( x  e.  A  ->  ( x  =  D  ->  y  =  C ) ) ) )
1918com34 83 . . . . 5  |-  ( ph  ->  ( y  e.  B  ->  ( x  =  D  ->  ( x  e.  A  ->  y  =  C ) ) ) )
2019imp32 255 . . . 4  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  -> 
( x  e.  A  ->  y  =  C ) )
2115, 20jcai 309 . . 3  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  -> 
( x  e.  A  /\  y  =  C
) )
2212, 21impbida 591 . 2  |-  ( ph  ->  ( ( x  e.  A  /\  y  =  C )  <->  ( y  e.  B  /\  x  =  D ) ) )
231, 2, 3, 22f1ocnvd 6051 1  |-  ( ph  ->  ( F : A -1-1-onto-> B  /\  `' F  =  (
y  e.  B  |->  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141    |-> cmpt 4050   `'ccnv 4610   -1-1-onto->wf1o 5197
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205
This theorem is referenced by:  f1o2d  6054  negf1o  8301  negiso  8871  iccf1o  9961  xrnegiso  11225  grpinvcnv  12767  txhmeo  13113
  Copyright terms: Public domain W3C validator