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

Theorem nneneq 7148
Description: Two equinumerous natural numbers are equal. Proposition 10.20 of [TakeutiZaring] p. 90 and its converse. Also compare Corollary 6E of [Enderton] p. 136. (Contributed by NM, 28-May-1998.)
Assertion
Ref Expression
nneneq  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  ~~  B  <->  A  =  B ) )

Proof of Theorem nneneq
Dummy variables  x  y  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq1 4128 . . . . . 6  |-  ( x  =  (/)  ->  ( x 
~~  z  <->  (/)  ~~  z
) )
2 eqeq1 2245 . . . . . 6  |-  ( x  =  (/)  ->  ( x  =  z  <->  (/)  =  z ) )
31, 2imbi12d 234 . . . . 5  |-  ( x  =  (/)  ->  ( ( x  ~~  z  ->  x  =  z )  <->  (
(/)  ~~  z  ->  (/)  =  z ) ) )
43ralbidv 2550 . . . 4  |-  ( x  =  (/)  ->  ( A. z  e.  om  (
x  ~~  z  ->  x  =  z )  <->  A. z  e.  om  ( (/)  ~~  z  -> 
(/)  =  z ) ) )
5 breq1 4128 . . . . . 6  |-  ( x  =  y  ->  (
x  ~~  z  <->  y  ~~  z ) )
6 eqeq1 2245 . . . . . 6  |-  ( x  =  y  ->  (
x  =  z  <->  y  =  z ) )
75, 6imbi12d 234 . . . . 5  |-  ( x  =  y  ->  (
( x  ~~  z  ->  x  =  z )  <-> 
( y  ~~  z  ->  y  =  z ) ) )
87ralbidv 2550 . . . 4  |-  ( x  =  y  ->  ( A. z  e.  om  ( x  ~~  z  ->  x  =  z )  <->  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) ) )
9 breq1 4128 . . . . . 6  |-  ( x  =  suc  y  -> 
( x  ~~  z  <->  suc  y  ~~  z ) )
10 eqeq1 2245 . . . . . 6  |-  ( x  =  suc  y  -> 
( x  =  z  <->  suc  y  =  z
) )
119, 10imbi12d 234 . . . . 5  |-  ( x  =  suc  y  -> 
( ( x  ~~  z  ->  x  =  z )  <->  ( suc  y  ~~  z  ->  suc  y  =  z ) ) )
1211ralbidv 2550 . . . 4  |-  ( x  =  suc  y  -> 
( A. z  e. 
om  ( x  ~~  z  ->  x  =  z )  <->  A. z  e.  om  ( suc  y  ~~  z  ->  suc  y  =  z ) ) )
13 breq1 4128 . . . . . 6  |-  ( x  =  A  ->  (
x  ~~  z  <->  A  ~~  z ) )
14 eqeq1 2245 . . . . . 6  |-  ( x  =  A  ->  (
x  =  z  <->  A  =  z ) )
1513, 14imbi12d 234 . . . . 5  |-  ( x  =  A  ->  (
( x  ~~  z  ->  x  =  z )  <-> 
( A  ~~  z  ->  A  =  z ) ) )
1615ralbidv 2550 . . . 4  |-  ( x  =  A  ->  ( A. z  e.  om  ( x  ~~  z  ->  x  =  z )  <->  A. z  e.  om  ( A  ~~  z  ->  A  =  z ) ) )
17 ensym 7058 . . . . . 6  |-  ( (/)  ~~  z  ->  z  ~~  (/) )
18 en0 7072 . . . . . . 7  |-  ( z 
~~  (/)  <->  z  =  (/) )
19 eqcom 2240 . . . . . . 7  |-  ( z  =  (/)  <->  (/)  =  z )
2018, 19bitri 184 . . . . . 6  |-  ( z 
~~  (/)  <->  (/)  =  z )
2117, 20sylib 122 . . . . 5  |-  ( (/)  ~~  z  ->  (/)  =  z )
2221rgenw 2605 . . . 4  |-  A. z  e.  om  ( (/)  ~~  z  -> 
(/)  =  z )
23 nn0suc 4746 . . . . . . 7  |-  ( w  e.  om  ->  (
w  =  (/)  \/  E. z  e.  om  w  =  suc  z ) )
24 en0 7072 . . . . . . . . . . . 12  |-  ( suc  y  ~~  (/)  <->  suc  y  =  (/) )
25 breq2 4129 . . . . . . . . . . . . 13  |-  ( w  =  (/)  ->  ( suc  y  ~~  w  <->  suc  y  ~~  (/) ) )
26 eqeq2 2248 . . . . . . . . . . . . 13  |-  ( w  =  (/)  ->  ( suc  y  =  w  <->  suc  y  =  (/) ) )
2725, 26bibi12d 235 . . . . . . . . . . . 12  |-  ( w  =  (/)  ->  ( ( suc  y  ~~  w  <->  suc  y  =  w )  <-> 
( suc  y  ~~  (/)  <->  suc  y  =  (/) ) ) )
2824, 27mpbiri 168 . . . . . . . . . . 11  |-  ( w  =  (/)  ->  ( suc  y  ~~  w  <->  suc  y  =  w ) )
2928biimpd 144 . . . . . . . . . 10  |-  ( w  =  (/)  ->  ( suc  y  ~~  w  ->  suc  y  =  w
) )
3029a1i 9 . . . . . . . . 9  |-  ( ( y  e.  om  /\  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) )  ->  ( w  =  (/)  ->  ( suc  y  ~~  w  ->  suc  y  =  w ) ) )
31 nfv 1581 . . . . . . . . . . 11  |-  F/ z  y  e.  om
32 nfra1 2581 . . . . . . . . . . 11  |-  F/ z A. z  e.  om  ( y  ~~  z  ->  y  =  z )
3331, 32nfan 1618 . . . . . . . . . 10  |-  F/ z ( y  e.  om  /\ 
A. z  e.  om  ( y  ~~  z  ->  y  =  z ) )
34 nfv 1581 . . . . . . . . . 10  |-  F/ z ( suc  y  ~~  w  ->  suc  y  =  w )
35 rsp 2597 . . . . . . . . . . . . . 14  |-  ( A. z  e.  om  (
y  ~~  z  ->  y  =  z )  -> 
( z  e.  om  ->  ( y  ~~  z  ->  y  =  z ) ) )
36 vex 2824 . . . . . . . . . . . . . . . . . 18  |-  y  e. 
_V
37 vex 2824 . . . . . . . . . . . . . . . . . 18  |-  z  e. 
_V
3836, 37phplem4 7146 . . . . . . . . . . . . . . . . 17  |-  ( ( y  e.  om  /\  z  e.  om )  ->  ( suc  y  ~~  suc  z  ->  y  ~~  z ) )
3938imim1d 75 . . . . . . . . . . . . . . . 16  |-  ( ( y  e.  om  /\  z  e.  om )  ->  ( ( y  ~~  z  ->  y  =  z )  ->  ( suc  y  ~~  suc  z  -> 
y  =  z ) ) )
4039ex 115 . . . . . . . . . . . . . . 15  |-  ( y  e.  om  ->  (
z  e.  om  ->  ( ( y  ~~  z  ->  y  =  z )  ->  ( suc  y  ~~  suc  z  ->  y  =  z ) ) ) )
4140a2d 26 . . . . . . . . . . . . . 14  |-  ( y  e.  om  ->  (
( z  e.  om  ->  ( y  ~~  z  ->  y  =  z ) )  ->  ( z  e.  om  ->  ( suc  y  ~~  suc  z  -> 
y  =  z ) ) ) )
4235, 41syl5 32 . . . . . . . . . . . . 13  |-  ( y  e.  om  ->  ( A. z  e.  om  ( y  ~~  z  ->  y  =  z )  ->  ( z  e. 
om  ->  ( suc  y  ~~  suc  z  ->  y  =  z ) ) ) )
4342imp 124 . . . . . . . . . . . 12  |-  ( ( y  e.  om  /\  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) )  ->  ( z  e. 
om  ->  ( suc  y  ~~  suc  z  ->  y  =  z ) ) )
44 suceq 4542 . . . . . . . . . . . 12  |-  ( y  =  z  ->  suc  y  =  suc  z )
4543, 44syl8 71 . . . . . . . . . . 11  |-  ( ( y  e.  om  /\  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) )  ->  ( z  e. 
om  ->  ( suc  y  ~~  suc  z  ->  suc  y  =  suc  z ) ) )
46 breq2 4129 . . . . . . . . . . . . 13  |-  ( w  =  suc  z  -> 
( suc  y  ~~  w 
<->  suc  y  ~~  suc  z ) )
47 eqeq2 2248 . . . . . . . . . . . . 13  |-  ( w  =  suc  z  -> 
( suc  y  =  w 
<->  suc  y  =  suc  z ) )
4846, 47imbi12d 234 . . . . . . . . . . . 12  |-  ( w  =  suc  z  -> 
( ( suc  y  ~~  w  ->  suc  y  =  w )  <->  ( suc  y  ~~  suc  z  ->  suc  y  =  suc  z ) ) )
4948biimprcd 160 . . . . . . . . . . 11  |-  ( ( suc  y  ~~  suc  z  ->  suc  y  =  suc  z )  ->  (
w  =  suc  z  ->  ( suc  y  ~~  w  ->  suc  y  =  w ) ) )
5045, 49syl6 33 . . . . . . . . . 10  |-  ( ( y  e.  om  /\  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) )  ->  ( z  e. 
om  ->  ( w  =  suc  z  ->  ( suc  y  ~~  w  ->  suc  y  =  w
) ) ) )
5133, 34, 50rexlimd 2665 . . . . . . . . 9  |-  ( ( y  e.  om  /\  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) )  ->  ( E. z  e.  om  w  =  suc  z  ->  ( suc  y  ~~  w  ->  suc  y  =  w ) ) )
5230, 51jaod 729 . . . . . . . 8  |-  ( ( y  e.  om  /\  A. z  e.  om  (
y  ~~  z  ->  y  =  z ) )  ->  ( ( w  =  (/)  \/  E. z  e.  om  w  =  suc  z )  ->  ( suc  y  ~~  w  ->  suc  y  =  w
) ) )
5352ex 115 . . . . . . 7  |-  ( y  e.  om  ->  ( A. z  e.  om  ( y  ~~  z  ->  y  =  z )  ->  ( ( w  =  (/)  \/  E. z  e.  om  w  =  suc  z )  ->  ( suc  y  ~~  w  ->  suc  y  =  w
) ) ) )
5423, 53syl7 69 . . . . . 6  |-  ( y  e.  om  ->  ( A. z  e.  om  ( y  ~~  z  ->  y  =  z )  ->  ( w  e. 
om  ->  ( suc  y  ~~  w  ->  suc  y  =  w ) ) ) )
5554ralrimdv 2629 . . . . 5  |-  ( y  e.  om  ->  ( A. z  e.  om  ( y  ~~  z  ->  y  =  z )  ->  A. w  e.  om  ( suc  y  ~~  w  ->  suc  y  =  w ) ) )
56 breq2 4129 . . . . . . 7  |-  ( w  =  z  ->  ( suc  y  ~~  w  <->  suc  y  ~~  z ) )
57 eqeq2 2248 . . . . . . 7  |-  ( w  =  z  ->  ( suc  y  =  w  <->  suc  y  =  z ) )
5856, 57imbi12d 234 . . . . . 6  |-  ( w  =  z  ->  (
( suc  y  ~~  w  ->  suc  y  =  w )  <->  ( suc  y  ~~  z  ->  suc  y  =  z )
) )
5958cbvralv 2786 . . . . 5  |-  ( A. w  e.  om  ( suc  y  ~~  w  ->  suc  y  =  w
)  <->  A. z  e.  om  ( suc  y  ~~  z  ->  suc  y  =  z ) )
6055, 59imbitrdi 161 . . . 4  |-  ( y  e.  om  ->  ( A. z  e.  om  ( y  ~~  z  ->  y  =  z )  ->  A. z  e.  om  ( suc  y  ~~  z  ->  suc  y  =  z ) ) )
614, 8, 12, 16, 22, 60finds 4742 . . 3  |-  ( A  e.  om  ->  A. z  e.  om  ( A  ~~  z  ->  A  =  z ) )
62 breq2 4129 . . . . 5  |-  ( z  =  B  ->  ( A  ~~  z  <->  A  ~~  B ) )
63 eqeq2 2248 . . . . 5  |-  ( z  =  B  ->  ( A  =  z  <->  A  =  B ) )
6462, 63imbi12d 234 . . . 4  |-  ( z  =  B  ->  (
( A  ~~  z  ->  A  =  z )  <-> 
( A  ~~  B  ->  A  =  B ) ) )
6564rspcv 2925 . . 3  |-  ( B  e.  om  ->  ( A. z  e.  om  ( A  ~~  z  ->  A  =  z )  ->  ( A  ~~  B  ->  A  =  B ) ) )
6661, 65mpan9 281 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  ~~  B  ->  A  =  B ) )
67 eqeng 7042 . . 3  |-  ( A  e.  om  ->  ( A  =  B  ->  A 
~~  B ) )
6867adantr 276 . 2  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  =  B  ->  A  ~~  B
) )
6966, 68impbid 129 1  |-  ( ( A  e.  om  /\  B  e.  om )  ->  ( A  ~~  B  <->  A  =  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 720    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   (/)c0 3520   class class class wbr 4125   suc csuc 4505   omcom 4732    ~~ cen 7010
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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-er 6797  df-en 7013
This theorem is referenced by:  findcard2  7183  findcard2s  7184  fidcen  7193  unsnfidcex  7217  unsnfidcel  7218  exmidonfinlem  7535  hashen  11201  hashunlem  11222
  Copyright terms: Public domain W3C validator