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

Theorem infn0 9272
Description: An infinite set is not empty. For a shorter proof using ax-un 7745, see infn0ALT 9273. (Contributed by NM, 23-Oct-2004.) Avoid ax-un 7745. (Revised by BTernaryTau, 8-Jan-2025.)
Assertion
Ref Expression
infn0 (ω ≼ 𝐴𝐴 ≠ ∅)

Proof of Theorem infn0
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 brdomi 8965 . 2 (ω ≼ 𝐴 → ∃𝑓 𝑓:ω–1-1𝐴)
2 peano1 7894 . . . . . 6 ∅ ∈ ω
3 f1f1orn 6839 . . . . . . . . 9 (𝑓:ω–1-1𝐴𝑓:ω–1-1-onto→ran 𝑓)
43adantr 486 . . . . . . . 8 ((𝑓:ω–1-1𝐴𝐴 = ∅) → 𝑓:ω–1-1-onto→ran 𝑓)
5 f1f 6781 . . . . . . . . . . 11 (𝑓:ω–1-1𝐴𝑓:ω⟶𝐴)
65frnd 6721 . . . . . . . . . 10 (𝑓:ω–1-1𝐴 → ran 𝑓𝐴)
7 sseq0 4364 . . . . . . . . . 10 ((ran 𝑓𝐴𝐴 = ∅) → ran 𝑓 = ∅)
86, 7sylan 592 . . . . . . . . 9 ((𝑓:ω–1-1𝐴𝐴 = ∅) → ran 𝑓 = ∅)
98f1oeq3d 6824 . . . . . . . 8 ((𝑓:ω–1-1𝐴𝐴 = ∅) → (𝑓:ω–1-1-onto→ran 𝑓𝑓:ω–1-1-onto→∅))
104, 9mpbid 235 . . . . . . 7 ((𝑓:ω–1-1𝐴𝐴 = ∅) → 𝑓:ω–1-1-onto→∅)
11 f1ocnv 6840 . . . . . . 7 (𝑓:ω–1-1-onto→∅ → 𝑓:∅–1-1-onto→ω)
12 noel 4294 . . . . . . . 8 ¬ ∅ ∈ ∅
13 f1o00 6863 . . . . . . . . . 10 (𝑓:∅–1-1-onto→ω ↔ (𝑓 = ∅ ∧ ω = ∅))
1413simprbi 503 . . . . . . . . 9 (𝑓:∅–1-1-onto→ω → ω = ∅)
1514eleq2d 2852 . . . . . . . 8 (𝑓:∅–1-1-onto→ω → (∅ ∈ ω ↔ ∅ ∈ ∅))
1612, 15mtbiri 330 . . . . . . 7 (𝑓:∅–1-1-onto→ω → ¬ ∅ ∈ ω)
1710, 11, 163syl 19 . . . . . 6 ((𝑓:ω–1-1𝐴𝐴 = ∅) → ¬ ∅ ∈ ω)
182, 17mt2 203 . . . . 5 ¬ (𝑓:ω–1-1𝐴𝐴 = ∅)
1918imnani 406 . . . 4 (𝑓:ω–1-1𝐴 → ¬ 𝐴 = ∅)
2019neqned 2968 . . 3 (𝑓:ω–1-1𝐴𝐴 ≠ ∅)
2120exlimiv 1963 . 2 (∃𝑓 𝑓:ω–1-1𝐴𝐴 ≠ ∅)
221, 21syl 18 1 (ω ≼ 𝐴𝐴 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wex 1812  wcel 2146  wne 2961  wss 3908  c0 4289   class class class wbr 5114  ccnv 5665  ran crn 5667  1-1wf1 6540  1-1-ontowf1o 6542  ωcom 7871  cdom 8950
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2570  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-ord 6370  df-on 6371  df-lim 6372  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-om 7872  df-dom 8954
This theorem is used by:  infpwfien  10065  infxp  10216  infpss  10218  alephmul  10581  csdfil  24088
  Copyright terms: Public domain W3C validator