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

Theorem phplem3 7492
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 4785 . 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 7491 . . 3  |-  ( ( A  e.  om  /\  B  e.  A )  ->  A  ~~  ( suc 
A  \  { B } ) )
52enref 7342 . . . 4  |-  A  ~~  A
6 nnord 6484 . . . . . 6  |-  ( A  e.  om  ->  Ord  A )
7 orddif 4812 . . . . . 6  |-  ( Ord 
A  ->  A  =  ( suc  A  \  { A } ) )
86, 7syl 16 . . . . 5  |-  ( A  e.  om  ->  A  =  ( suc  A  \  { A } ) )
9 sneq 3887 . . . . . . 7  |-  ( A  =  B  ->  { A }  =  { B } )
109difeq2d 3474 . . . . . 6  |-  ( A  =  B  ->  ( suc  A  \  { A } )  =  ( suc  A  \  { B } ) )
1110eqcoms 2446 . . . . 5  |-  ( B  =  A  ->  ( suc  A  \  { A } )  =  ( suc  A  \  { B } ) )
128, 11sylan9eq 2495 . . . 4  |-  ( ( A  e.  om  /\  B  =  A )  ->  A  =  ( suc 
A  \  { B } ) )
135, 12syl5breq 4327 . . 3  |-  ( ( A  e.  om  /\  B  =  A )  ->  A  ~~  ( suc 
A  \  { B } ) )
144, 13jaodan 783 . 2  |-  ( ( A  e.  om  /\  ( B  e.  A  \/  B  =  A
) )  ->  A  ~~  ( suc  A  \  { B } ) )
151, 14sylan2 474 1  |-  ( ( A  e.  om  /\  B  e.  suc  A )  ->  A  ~~  ( suc  A  \  { B } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 368    /\ wa 369    = wceq 1369    e. wcel 1756   _Vcvv 2972    \ cdif 3325   {csn 3877   class class class wbr 4292   Ord word 4718   suc csuc 4721   omcom 6476    ~~ cen 7307
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4413  ax-nul 4421  ax-pow 4470  ax-pr 4531  ax-un 6372
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2568  df-ne 2608  df-ral 2720  df-rex 2721  df-rab 2724  df-v 2974  df-sbc 3187  df-dif 3331  df-un 3333  df-in 3335  df-ss 3342  df-pss 3344  df-nul 3638  df-if 3792  df-pw 3862  df-sn 3878  df-pr 3880  df-tp 3882  df-op 3884  df-uni 4092  df-br 4293  df-opab 4351  df-tr 4386  df-eprel 4632  df-id 4636  df-po 4641  df-so 4642  df-fr 4679  df-we 4681  df-ord 4722  df-on 4723  df-lim 4724  df-suc 4725  df-xp 4846  df-rel 4847  df-cnv 4848  df-co 4849  df-dm 4850  df-rn 4851  df-res 4852  df-ima 4853  df-fun 5420  df-fn 5421  df-f 5422  df-f1 5423  df-fo 5424  df-f1o 5425  df-om 6477  df-en 7311
This theorem is referenced by:  phplem4  7493  php  7495
  Copyright terms: Public domain W3C validator