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

Theorem php5dom 6960
Description: A natural number does not dominate its successor. (Contributed by Jim Kingdon, 1-Sep-2021.)
Assertion
Ref Expression
php5dom  |-  ( A  e.  om  ->  -.  suc  A  ~<_  A )

Proof of Theorem php5dom
Dummy variables  w  k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suceq 4449 . . . 4  |-  ( w  =  (/)  ->  suc  w  =  suc  (/) )
2 id 19 . . . 4  |-  ( w  =  (/)  ->  w  =  (/) )
31, 2breq12d 4057 . . 3  |-  ( w  =  (/)  ->  ( suc  w  ~<_  w  <->  suc  (/)  ~<_  (/) ) )
43notbid 669 . 2  |-  ( w  =  (/)  ->  ( -. 
suc  w  ~<_  w  <->  -.  suc  (/)  ~<_  (/) ) )
5 suceq 4449 . . . 4  |-  ( w  =  k  ->  suc  w  =  suc  k )
6 id 19 . . . 4  |-  ( w  =  k  ->  w  =  k )
75, 6breq12d 4057 . . 3  |-  ( w  =  k  ->  ( suc  w  ~<_  w  <->  suc  k  ~<_  k ) )
87notbid 669 . 2  |-  ( w  =  k  ->  ( -.  suc  w  ~<_  w  <->  -.  suc  k  ~<_  k ) )
9 suceq 4449 . . . 4  |-  ( w  =  suc  k  ->  suc  w  =  suc  suc  k )
10 id 19 . . . 4  |-  ( w  =  suc  k  ->  w  =  suc  k )
119, 10breq12d 4057 . . 3  |-  ( w  =  suc  k  -> 
( suc  w  ~<_  w  <->  suc  suc  k  ~<_  suc  k ) )
1211notbid 669 . 2  |-  ( w  =  suc  k  -> 
( -.  suc  w  ~<_  w 
<->  -.  suc  suc  k  ~<_  suc  k ) )
13 suceq 4449 . . . 4  |-  ( w  =  A  ->  suc  w  =  suc  A )
14 id 19 . . . 4  |-  ( w  =  A  ->  w  =  A )
1513, 14breq12d 4057 . . 3  |-  ( w  =  A  ->  ( suc  w  ~<_  w  <->  suc  A  ~<_  A ) )
1615notbid 669 . 2  |-  ( w  =  A  ->  ( -.  suc  w  ~<_  w  <->  -.  suc  A  ~<_  A ) )
17 peano1 4642 . . . 4  |-  (/)  e.  om
18 php5 6955 . . . 4  |-  ( (/)  e.  om  ->  -.  (/)  ~~  suc  (/) )
1917, 18ax-mp 5 . . 3  |-  -.  (/)  ~~  suc  (/)
20 0ex 4171 . . . . . 6  |-  (/)  e.  _V
2120domen 6840 . . . . 5  |-  ( suc  (/) 
~<_  (/)  <->  E. x ( suc  (/)  ~~  x  /\  x  C_  (/) ) )
22 ss0 3501 . . . . . . . 8  |-  ( x 
C_  (/)  ->  x  =  (/) )
23 en0 6887 . . . . . . . 8  |-  ( x 
~~  (/)  <->  x  =  (/) )
2422, 23sylibr 134 . . . . . . 7  |-  ( x 
C_  (/)  ->  x  ~~  (/) )
25 entr 6876 . . . . . . 7  |-  ( ( suc  (/)  ~~  x  /\  x  ~~  (/) )  ->  suc  (/)  ~~  (/) )
2624, 25sylan2 286 . . . . . 6  |-  ( ( suc  (/)  ~~  x  /\  x  C_  (/) )  ->  suc  (/)  ~~  (/) )
2726exlimiv 1621 . . . . 5  |-  ( E. x ( suc  (/)  ~~  x  /\  x  C_  (/) )  ->  suc  (/)  ~~  (/) )
2821, 27sylbi 121 . . . 4  |-  ( suc  (/) 
~<_  (/)  ->  suc  (/)  ~~  (/) )
2928ensymd 6875 . . 3  |-  ( suc  (/) 
~<_  (/)  ->  (/)  ~~  suc  (/) )
3019, 29mto 664 . 2  |-  -.  suc  (/)  ~<_  (/)
31 peano2 4643 . . . 4  |-  ( k  e.  om  ->  suc  k  e.  om )
32 phplem4dom 6959 . . . 4  |-  ( ( suc  k  e.  om  /\  k  e.  om )  ->  ( suc  suc  k  ~<_  suc  k  ->  suc  k  ~<_  k ) )
3331, 32mpancom 422 . . 3  |-  ( k  e.  om  ->  ( suc  suc  k  ~<_  suc  k  ->  suc  k  ~<_  k ) )
3433con3d 632 . 2  |-  ( k  e.  om  ->  ( -.  suc  k  ~<_  k  ->  -.  suc  suc  k  ~<_  suc  k
) )
354, 8, 12, 16, 30, 34finds 4648 1  |-  ( A  e.  om  ->  -.  suc  A  ~<_  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    = wceq 1373   E.wex 1515    e. wcel 2176    C_ wss 3166   (/)c0 3460   class class class wbr 4044   suc csuc 4412   omcom 4638    ~~ cen 6825    ~<_ cdom 6826
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-br 4045  df-opab 4106  df-tr 4143  df-id 4340  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-er 6620  df-en 6828  df-dom 6829
This theorem is referenced by:  nndomo  6961  phpm  6962  infnfi  6992
  Copyright terms: Public domain W3C validator