MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  infpss Structured version   Visualization version   GIF version

Theorem infpss 9642
Description: Every infinite set has an equinumerous proper subset, proved without AC or Infinity. Exercise 7 of [TakeutiZaring] p. 91. See also infpssALT 9738. (Contributed by NM, 23-Oct-2004.) (Revised by Mario Carneiro, 30-Apr-2015.)
Assertion
Ref Expression
infpss (ω ≼ 𝐴 → ∃𝑥(𝑥𝐴𝑥𝐴))
Distinct variable group:   𝑥,𝐴

Proof of Theorem infpss
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 infn0 8783 . . 3 (ω ≼ 𝐴𝐴 ≠ ∅)
2 n0 4313 . . 3 (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦𝐴)
31, 2sylib 220 . 2 (ω ≼ 𝐴 → ∃𝑦 𝑦𝐴)
4 reldom 8518 . . . . . 6 Rel ≼
54brrelex2i 5612 . . . . 5 (ω ≼ 𝐴𝐴 ∈ V)
6 difexg 5234 . . . . 5 (𝐴 ∈ V → (𝐴 ∖ {𝑦}) ∈ V)
75, 6syl 17 . . . 4 (ω ≼ 𝐴 → (𝐴 ∖ {𝑦}) ∈ V)
87adantr 483 . . 3 ((ω ≼ 𝐴𝑦𝐴) → (𝐴 ∖ {𝑦}) ∈ V)
9 simpr 487 . . . . 5 ((ω ≼ 𝐴𝑦𝐴) → 𝑦𝐴)
10 difsnpss 4743 . . . . 5 (𝑦𝐴 ↔ (𝐴 ∖ {𝑦}) ⊊ 𝐴)
119, 10sylib 220 . . . 4 ((ω ≼ 𝐴𝑦𝐴) → (𝐴 ∖ {𝑦}) ⊊ 𝐴)
12 infdifsn 9123 . . . . 5 (ω ≼ 𝐴 → (𝐴 ∖ {𝑦}) ≈ 𝐴)
1312adantr 483 . . . 4 ((ω ≼ 𝐴𝑦𝐴) → (𝐴 ∖ {𝑦}) ≈ 𝐴)
1411, 13jca 514 . . 3 ((ω ≼ 𝐴𝑦𝐴) → ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≈ 𝐴))
15 psseq1 4067 . . . 4 (𝑥 = (𝐴 ∖ {𝑦}) → (𝑥𝐴 ↔ (𝐴 ∖ {𝑦}) ⊊ 𝐴))
16 breq1 5072 . . . 4 (𝑥 = (𝐴 ∖ {𝑦}) → (𝑥𝐴 ↔ (𝐴 ∖ {𝑦}) ≈ 𝐴))
1715, 16anbi12d 632 . . 3 (𝑥 = (𝐴 ∖ {𝑦}) → ((𝑥𝐴𝑥𝐴) ↔ ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≈ 𝐴)))
188, 14, 17spcedv 3602 . 2 ((ω ≼ 𝐴𝑦𝐴) → ∃𝑥(𝑥𝐴𝑥𝐴))
193, 18exlimddv 1935 1 (ω ≼ 𝐴 → ∃𝑥(𝑥𝐴𝑥𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1536  wex 1779  wcel 2113  wne 3019  Vcvv 3497  cdif 3936  wpss 3940  c0 4294  {csn 4570   class class class wbr 5069  ωcom 7583  cen 8509  cdom 8510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-om 7584  df-1o 8105  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-fin 8516
This theorem is referenced by:  isfin4-2  9739
  Copyright terms: Public domain W3C validator