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

Theorem phplem1 7119
Description: Lemma for Pigeonhole Principle. If we join a natural number to itself minus an element, we end up with its successor minus the same element. (Contributed by NM, 25-May-1998.)
Assertion
Ref Expression
phplem1  |-  ( ( A  e.  om  /\  B  e.  A )  ->  ( { A }  u.  ( A  \  { B } ) )  =  ( suc  A  \  { B } ) )

Proof of Theorem phplem1
StepHypRef Expression
1 nnord 4739 . . 3  |-  ( A  e.  om  ->  Ord  A )
2 nordeq 4671 . . . 4  |-  ( ( Ord  A  /\  B  e.  A )  ->  A  =/=  B )
3 disjsn2 3757 . . . 4  |-  ( A  =/=  B  ->  ( { A }  i^i  { B } )  =  (/) )
42, 3syl 14 . . 3  |-  ( ( Ord  A  /\  B  e.  A )  ->  ( { A }  i^i  { B } )  =  (/) )
51, 4sylan 283 . 2  |-  ( ( A  e.  om  /\  B  e.  A )  ->  ( { A }  i^i  { B } )  =  (/) )
6 undif4 3575 . . 3  |-  ( ( { A }  i^i  { B } )  =  (/)  ->  ( { A }  u.  ( A  \  { B } ) )  =  ( ( { A }  u.  A )  \  { B } ) )
7 df-suc 4497 . . . . 5  |-  suc  A  =  ( A  u.  { A } )
87equncomi 3369 . . . 4  |-  suc  A  =  ( { A }  u.  A )
98difeq1i 3337 . . 3  |-  ( suc 
A  \  { B } )  =  ( ( { A }  u.  A )  \  { B } )
106, 9eqtr4di 2285 . 2  |-  ( ( { A }  i^i  { B } )  =  (/)  ->  ( { A }  u.  ( A  \  { B } ) )  =  ( suc 
A  \  { B } ) )
115, 10syl 14 1  |-  ( ( A  e.  om  /\  B  e.  A )  ->  ( { A }  u.  ( A  \  { B } ) )  =  ( suc  A  \  { B } ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205    =/= wne 2414    \ cdif 3211    u. cun 3212    i^i cin 3213   (/)c0 3512   {csn 3694   Ord word 4488   suc csuc 4491   omcom 4717
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-tr 4214  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718
This theorem is referenced by:  phplem2  7120
  Copyright terms: Public domain W3C validator