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

Theorem f1ocnv2d 5704
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 2109 . . . . . 6  |-  ( C  e.  B  ->  (
y  =  C  -> 
y  e.  B ) )
52, 4syl 14 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  (
y  =  C  -> 
y  e.  B ) )
65impr 361 . . . 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 281 . . . . . . 7  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  B )
)  /\  y  =  C )  ->  x  =  D )
98exp42 353 . . . . . 6  |-  ( ph  ->  ( x  e.  A  ->  ( y  e.  B  ->  ( y  =  C  ->  x  =  D ) ) ) )
109com34 77 . . . . 5  |-  ( ph  ->  ( x  e.  A  ->  ( y  =  C  ->  ( y  e.  B  ->  x  =  D ) ) ) )
1110imp32 244 . . . 4  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
( y  e.  B  ->  x  =  D ) )
126, 11jcai 294 . . 3  |-  ( (
ph  /\  ( x  e.  A  /\  y  =  C ) )  -> 
( y  e.  B  /\  x  =  D
) )
13 eleq1a 2109 . . . . . 6  |-  ( D  e.  A  ->  (
x  =  D  ->  x  e.  A )
)
143, 13syl 14 . . . . 5  |-  ( (
ph  /\  y  e.  B )  ->  (
x  =  D  ->  x  e.  A )
)
1514impr 361 . . . 4  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  ->  x  e.  A )
167biimpa 280 . . . . . . . 8  |-  ( ( ( ph  /\  (
x  e.  A  /\  y  e.  B )
)  /\  x  =  D )  ->  y  =  C )
1716exp42 353 . . . . . . 7  |-  ( ph  ->  ( x  e.  A  ->  ( y  e.  B  ->  ( x  =  D  ->  y  =  C ) ) ) )
1817com23 72 . . . . . 6  |-  ( ph  ->  ( y  e.  B  ->  ( x  e.  A  ->  ( x  =  D  ->  y  =  C ) ) ) )
1918com34 77 . . . . 5  |-  ( ph  ->  ( y  e.  B  ->  ( x  =  D  ->  ( x  e.  A  ->  y  =  C ) ) ) )
2019imp32 244 . . . 4  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  -> 
( x  e.  A  ->  y  =  C ) )
2115, 20jcai 294 . . 3  |-  ( (
ph  /\  ( y  e.  B  /\  x  =  D ) )  -> 
( x  e.  A  /\  y  =  C
) )
2212, 21impbida 528 . 2  |-  ( ph  ->  ( ( x  e.  A  /\  y  =  C )  <->  ( y  e.  B  /\  x  =  D ) ) )
231, 2, 3, 22f1ocnvd 5702 1  |-  ( ph  ->  ( F : A -1-1-onto-> B  /\  `' F  =  (
y  e.  B  |->  D ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    = wceq 1243    e. wcel 1393    |-> cmpt 3818   `'ccnv 4344   -1-1-onto->wf1o 4901
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909
This theorem is referenced by:  f1o2d  5705  iccf1o  8872
  Copyright terms: Public domain W3C validator