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

Theorem phplem3g 6716
 Description: A natural number is equinumerous to its successor minus any element of the successor. Version of phplem3 6714 with unnecessary hypotheses removed. (Contributed by Jim Kingdon, 1-Sep-2021.)
Assertion
Ref Expression
phplem3g ((𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))

Proof of Theorem phplem3g
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2178 . . . . 5 (𝑏 = 𝐵 → (𝑏 ∈ suc 𝐴𝐵 ∈ suc 𝐴))
21anbi2d 457 . . . 4 (𝑏 = 𝐵 → ((𝐴 ∈ ω ∧ 𝑏 ∈ suc 𝐴) ↔ (𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴)))
3 sneq 3506 . . . . . 6 (𝑏 = 𝐵 → {𝑏} = {𝐵})
43difeq2d 3162 . . . . 5 (𝑏 = 𝐵 → (suc 𝐴 ∖ {𝑏}) = (suc 𝐴 ∖ {𝐵}))
54breq2d 3909 . . . 4 (𝑏 = 𝐵 → (𝐴 ≈ (suc 𝐴 ∖ {𝑏}) ↔ 𝐴 ≈ (suc 𝐴 ∖ {𝐵})))
62, 5imbi12d 233 . . 3 (𝑏 = 𝐵 → (((𝐴 ∈ ω ∧ 𝑏 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝑏})) ↔ ((𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))))
7 eleq1 2178 . . . . . . 7 (𝑎 = 𝐴 → (𝑎 ∈ ω ↔ 𝐴 ∈ ω))
8 suceq 4292 . . . . . . . 8 (𝑎 = 𝐴 → suc 𝑎 = suc 𝐴)
98eleq2d 2185 . . . . . . 7 (𝑎 = 𝐴 → (𝑏 ∈ suc 𝑎𝑏 ∈ suc 𝐴))
107, 9anbi12d 462 . . . . . 6 (𝑎 = 𝐴 → ((𝑎 ∈ ω ∧ 𝑏 ∈ suc 𝑎) ↔ (𝐴 ∈ ω ∧ 𝑏 ∈ suc 𝐴)))
11 id 19 . . . . . . 7 (𝑎 = 𝐴𝑎 = 𝐴)
128difeq1d 3161 . . . . . . 7 (𝑎 = 𝐴 → (suc 𝑎 ∖ {𝑏}) = (suc 𝐴 ∖ {𝑏}))
1311, 12breq12d 3910 . . . . . 6 (𝑎 = 𝐴 → (𝑎 ≈ (suc 𝑎 ∖ {𝑏}) ↔ 𝐴 ≈ (suc 𝐴 ∖ {𝑏})))
1410, 13imbi12d 233 . . . . 5 (𝑎 = 𝐴 → (((𝑎 ∈ ω ∧ 𝑏 ∈ suc 𝑎) → 𝑎 ≈ (suc 𝑎 ∖ {𝑏})) ↔ ((𝐴 ∈ ω ∧ 𝑏 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝑏}))))
15 vex 2661 . . . . . 6 𝑎 ∈ V
16 vex 2661 . . . . . 6 𝑏 ∈ V
1715, 16phplem3 6714 . . . . 5 ((𝑎 ∈ ω ∧ 𝑏 ∈ suc 𝑎) → 𝑎 ≈ (suc 𝑎 ∖ {𝑏}))
1814, 17vtoclg 2718 . . . 4 (𝐴 ∈ ω → ((𝐴 ∈ ω ∧ 𝑏 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝑏})))
1918anabsi5 551 . . 3 ((𝐴 ∈ ω ∧ 𝑏 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝑏}))
206, 19vtoclg 2718 . 2 (𝐵 ∈ suc 𝐴 → ((𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵})))
2120anabsi7 553 1 ((𝐴 ∈ ω ∧ 𝐵 ∈ suc 𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   = wceq 1314   ∈ wcel 1463   ∖ cdif 3036  {csn 3495   class class class wbr 3897  suc csuc 4255  ωcom 4472   ≈ cen 6598 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4014  ax-nul 4022  ax-pow 4066  ax-pr 4099  ax-un 4323  ax-setind 4420  ax-iinf 4470 This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ne 2284  df-ral 2396  df-rex 2397  df-rab 2400  df-v 2660  df-dif 3041  df-un 3043  df-in 3045  df-ss 3052  df-nul 3332  df-pw 3480  df-sn 3501  df-pr 3502  df-op 3504  df-uni 3705  df-int 3740  df-br 3898  df-opab 3958  df-tr 3995  df-id 4183  df-iord 4256  df-on 4258  df-suc 4261  df-iom 4473  df-xp 4513  df-rel 4514  df-cnv 4515  df-co 4516  df-dm 4517  df-rn 4518  df-res 4519  df-ima 4520  df-fun 5093  df-fn 5094  df-f 5095  df-f1 5096  df-fo 5097  df-f1o 5098  df-en 6601 This theorem is referenced by:  phplem4dom  6722  phpm  6725  phplem4on  6727
 Copyright terms: Public domain W3C validator