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

Theorem en3d 6629
Description: Equinumerosity inference from an implicit one-to-one onto function. (Contributed by NM, 27-Jul-2004.) (Revised by Mario Carneiro, 12-May-2014.)
Hypotheses
Ref Expression
en3d.1  |-  ( ph  ->  A  e.  _V )
en3d.2  |-  ( ph  ->  B  e.  _V )
en3d.3  |-  ( ph  ->  ( x  e.  A  ->  C  e.  B ) )
en3d.4  |-  ( ph  ->  ( y  e.  B  ->  D  e.  A ) )
en3d.5  |-  ( ph  ->  ( ( x  e.  A  /\  y  e.  B )  ->  (
x  =  D  <->  y  =  C ) ) )
Assertion
Ref Expression
en3d  |-  ( ph  ->  A  ~~  B )
Distinct variable groups:    x, y, A   
x, B, y    y, C    x, D    ph, x, y
Allowed substitution hints:    C( x)    D( y)

Proof of Theorem en3d
StepHypRef Expression
1 en3d.1 . 2  |-  ( ph  ->  A  e.  _V )
2 en3d.2 . 2  |-  ( ph  ->  B  e.  _V )
3 eqid 2115 . . 3  |-  ( x  e.  A  |->  C )  =  ( x  e.  A  |->  C )
4 en3d.3 . . . 4  |-  ( ph  ->  ( x  e.  A  ->  C  e.  B ) )
54imp 123 . . 3  |-  ( (
ph  /\  x  e.  A )  ->  C  e.  B )
6 en3d.4 . . . 4  |-  ( ph  ->  ( y  e.  B  ->  D  e.  A ) )
76imp 123 . . 3  |-  ( (
ph  /\  y  e.  B )  ->  D  e.  A )
8 en3d.5 . . . 4  |-  ( ph  ->  ( ( x  e.  A  /\  y  e.  B )  ->  (
x  =  D  <->  y  =  C ) ) )
98imp 123 . . 3  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  B ) )  -> 
( x  =  D  <-> 
y  =  C ) )
103, 5, 7, 9f1o2d 5941 . 2  |-  ( ph  ->  ( x  e.  A  |->  C ) : A -1-1-onto-> B
)
11 f1oen2g 6615 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V  /\  (
x  e.  A  |->  C ) : A -1-1-onto-> B )  ->  A  ~~  B
)
121, 2, 10, 11syl3anc 1199 1  |-  ( ph  ->  A  ~~  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1314    e. wcel 1463   _Vcvv 2658   class class class wbr 3897    |-> cmpt 3957   -1-1-onto->wf1o 5090    ~~ cen 6598
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 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4014  ax-pow 4066  ax-pr 4099  ax-un 4323
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ral 2396  df-rex 2397  df-v 2660  df-un 3043  df-in 3045  df-ss 3052  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-br 3898  df-opab 3958  df-mpt 3959  df-id 4183  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-rn 4518  df-fun 5093  df-fn 5094  df-f 5095  df-f1 5096  df-fo 5097  df-f1o 5098  df-en 6601
This theorem is referenced by:  en3i  6631  fundmen  6666  mapen  6706  mapxpen  6708  ssenen  6711  fzen  9763  uzennn  10149  hashfacen  10519  hashdvds  11792
  Copyright terms: Public domain W3C validator