MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  phplem3 Unicode version

Theorem phplem3 7058
Description: Lemma for Pigeonhole Principle. A natural number is equinumerous to its successor minus any element of the successor. (Contributed by NM, 26-May-1998.)
Hypotheses
Ref Expression
phplem2.1  |-  A  e. 
_V
phplem2.2  |-  B  e. 
_V
Assertion
Ref Expression
phplem3  |-  ( ( A  e.  om  /\  B  e.  suc  A )  ->  A  ~~  ( suc  A  \  { B } ) )

Proof of Theorem phplem3
StepHypRef Expression
1 elsuci 4474 . 2  |-  ( B  e.  suc  A  -> 
( B  e.  A  \/  B  =  A
) )
2 phplem2.1 . . . 4  |-  A  e. 
_V
3 phplem2.2 . . . 4  |-  B  e. 
_V
42, 3phplem2 7057 . . 3  |-  ( ( A  e.  om  /\  B  e.  A )  ->  A  ~~  ( suc 
A  \  { B } ) )
52enref 6910 . . . 4  |-  A  ~~  A
6 nnord 4680 . . . . . 6  |-  ( A  e.  om  ->  Ord  A )
7 orddif 4502 . . . . . 6  |-  ( Ord 
A  ->  A  =  ( suc  A  \  { A } ) )
86, 7syl 15 . . . . 5  |-  ( A  e.  om  ->  A  =  ( suc  A  \  { A } ) )
9 sneq 3664 . . . . . . 7  |-  ( A  =  B  ->  { A }  =  { B } )
109difeq2d 3307 . . . . . 6  |-  ( A  =  B  ->  ( suc  A  \  { A } )  =  ( suc  A  \  { B } ) )
1110eqcoms 2299 . . . . 5  |-  ( B  =  A  ->  ( suc  A  \  { A } )  =  ( suc  A  \  { B } ) )
128, 11sylan9eq 2348 . . . 4  |-  ( ( A  e.  om  /\  B  =  A )  ->  A  =  ( suc 
A  \  { B } ) )
135, 12syl5breq 4074 . . 3  |-  ( ( A  e.  om  /\  B  =  A )  ->  A  ~~  ( suc 
A  \  { B } ) )
144, 13jaodan 760 . 2  |-  ( ( A  e.  om  /\  ( B  e.  A  \/  B  =  A
) )  ->  A  ~~  ( suc  A  \  { B } ) )
151, 14sylan2 460 1  |-  ( ( A  e.  om  /\  B  e.  suc  A )  ->  A  ~~  ( suc  A  \  { B } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 357    /\ wa 358    = wceq 1632    e. wcel 1696   _Vcvv 2801    \ cdif 3162   {csn 3653   class class class wbr 4039   Ord word 4407   suc csuc 4410   omcom 4672    ~~ cen 6876
This theorem is referenced by:  phplem4  7059  php  7061
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-rab 2565  df-v 2803  df-sbc 3005  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-br 4040  df-opab 4094  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-en 6880
  Copyright terms: Public domain W3C validator