HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem phplem4 3406
Description: Lemma for Pigeonhole Principle. A natural number is equinumerous to its successor minus any element of the successor.
Hypotheses
Ref Expression
phplem3.1 |- A e. V
phplem3.2 |- B e. V
Assertion
Ref Expression
phplem4 |- ((A e. om /\ B e. suc A) -> A ~~ (suc A \ {B}))

Proof of Theorem phplem4
StepHypRef Expression
1 andi 456 . . 3 |- ((A e. om /\ (B e. A \/ B = A)) <-> ((A e. om /\ B e. A) \/ (A e. om /\ B = A)))
2 phplem3.1 . . . . 5 |- A e. V
3 phplem3.2 . . . . 5 |- B e. V
42, 3phplem3 3405 . . . 4 |- ((A e. om /\ B e. A) -> A ~~ (suc A \ {B}))
5 nnord 2381 . . . . . . 7 |- (A e. om -> Ord A)
6 orddif 2326 . . . . . . 7 |- (Ord A -> A = (suc A \ {A}))
75, 6syl 12 . . . . . 6 |- (A e. om -> A = (suc A \ {A}))
8 sneq 1816 . . . . . . . 8 |- (A = B -> {A} = {B})
98difeq2d 1588 . . . . . . 7 |- (A = B -> (suc A \ {A}) = (suc A \ {B}))
109cleqcoms 1104 . . . . . 6 |- (B = A -> (suc A \ {A}) = (suc A \ {B}))
117, 10sylan9eq 1144 . . . . 5 |- ((A e. om /\ B = A) -> A = (suc A \ {B}))
122enref 3295 . . . . 5 |- A ~~ A
1311, 12syl5breq 2091 . . . 4 |- ((A e. om /\ B = A) -> A ~~ (suc A \ {B}))
144, 13jaoi 275 . . 3 |- (((A e. om /\ B e. A) \/ (A e. om /\ B = A)) -> A ~~ (suc A \ {B}))
151, 14sylbi 174 . 2 |- ((A e. om /\ (B e. A \/ B = A)) -> A ~~ (suc A \ {B}))
16 elsuci 2289 . 2 |- (B e. suc A -> (B e. A \/ B = A))
1715, 16sylan2 346 1 |- ((A e. om /\ B e. suc A) -> A ~~ (suc A \ {B}))
Colors of variables: wff set class
Syntax hints:   -> wi 2   \/ wo 195   /\ wa 196   = wceq 1091   e. wcel 1092  Vcvv 1348   \ cdif 1484  {csn 1808   class class class wbr 2054  Ord word 2198  suc csuc 2201  omcom 2372   ~~ cen 3271
This theorem is referenced by:  phplem5 3407  php 3409
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-id 2125  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-suc 2205  df-om 2373  df-xp 2424  df-rel 2425  df-cnv 2426  df-co 2427  df-dm 2428  df-rn 2429  df-res 2430  df-ima 2431  df-fun 2432  df-fn 2433  df-f 2434  df-f1 2435  df-fo 2436  df-f1o 2437  df-en 3274
metamath.org