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

Theorem phplem3 7149
Description: Lemma for Pigeonhole Principle. A natural number is equinumerous to its successor minus any element of the successor. For a version without the redundant hypotheses, see phplem3g 7151. (Contributed by NM, 26-May-1998.)
Hypotheses
Ref Expression
phplem2.1 𝐴 ∈ V
phplem2.2 𝐵 ∈ V
Assertion
Ref Expression
phplem3 ((𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))

Proof of Theorem phplem3
StepHypRef Expression
1 elsuci 4546 . 2 (𝐵 ∈ suc 𝐴 → (𝐵𝐴𝐵 = 𝐴))
2 phplem2.1 . . . 4 𝐴 ∈ V
3 phplem2.2 . . . 4 𝐵 ∈ V
42, 3phplem2 7148 . . 3 ((𝐴 ∈ ω ∧ 𝐵𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))
52enref 7045 . . . 4 𝐴𝐴
6 nnord 4757 . . . . . 6 (𝐴 ∈ ω → Ord 𝐴)
7 orddif 4692 . . . . . 6 (Ord 𝐴𝐴 = (suc 𝐴 ∖ {𝐴}))
86, 7syl 14 . . . . 5 (𝐴 ∈ ω → 𝐴 = (suc 𝐴 ∖ {𝐴}))
9 sneq 3719 . . . . . . 7 (𝐴 = 𝐵 → {𝐴} = {𝐵})
109difeq2d 3347 . . . . . 6 (𝐴 = 𝐵 → (suc 𝐴 ∖ {𝐴}) = (suc 𝐴 ∖ {𝐵}))
1110eqcoms 2241 . . . . 5 (𝐵 = 𝐴 → (suc 𝐴 ∖ {𝐴}) = (suc 𝐴 ∖ {𝐵}))
128, 11sylan9eq 2291 . . . 4 ((𝐴 ∈ ω ∧ 𝐵 = 𝐴) → 𝐴 = (suc 𝐴 ∖ {𝐵}))
135, 12breqtrid 4165 . . 3 ((𝐴 ∈ ω ∧ 𝐵 = 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))
144, 13jaodan 809 . 2 ((𝐴 ∈ ω ∧ (𝐵𝐴𝐵 = 𝐴)) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))
151, 14sylan2 286 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 720   = wceq 1402  wcel 2209  Vcvv 2821  cdif 3217  {csn 3708   class class class wbr 4128  Ord word 4505  suc csuc 4508  ωcom 4735  cen 7014
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-br 4129  df-opab 4191  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-en 7017
This theorem is referenced by:  phplem4  7150  phplem3g  7151
  Copyright terms: Public domain W3C validator