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

Theorem 1sdom 9253
Description: A set that strictly dominates ordinal 1 has at least 2 different members. (Closely related to 2dom 9065.) (Contributed by Mario Carneiro, 12-Jan-2013.) Avoid ax-un 7755. (Revised by BTernaryTau, 30-Dec-2024.)
Assertion
Ref Expression
1sdom (𝐴 ∈ 𝑉 → (1o ≺ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦))
Distinct variable group:   𝑥,𝐴,𝑦
Allowed substitution hints:   𝑉(𝑥, 𝑦)

Proof of Theorem 1sdom
StepHypRef Expression
1 1sdom2dom 9252 . 2 (1o ≺ 𝐴 ↔ 2o ≼ 𝐴)
2 2dom 9065 . . 3 (2o ≼ 𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦)
3 df-ne 2956 . . . . . 6 (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦)
432rexbii 3138 . . . . 5 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦)
5 rex2dom 9251 . . . . 5 ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦) → 2o ≼ 𝐴)
64, 5sylan2br 607 . . . 4 ((𝐴 ∈ 𝑉 ∧ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦) → 2o ≼ 𝐴)
76ex 418 . . 3 (𝐴 ∈ 𝑉 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦 → 2o ≼ 𝐴))
82, 7impbid2 229 . 2 (𝐴 ∈ 𝑉 → (2o ≼ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦))
91, 8bitrid 286 1 (𝐴 ∈ 𝑉 → (1o ≺ 𝐴 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086   class class class wbr 5102  1oc1o 8476  2oc2o 8477   ≼ cdom 8978   ≺ csdm 8979
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-1o 8483  df-2o 8484  df-en 8981  df-dom 8982  df-sdom 8983
This theorem is used by:  unxpdomlem3  9256  frgpnabl  20098  isnzr2  20777
  Copyright terms: Public domain W3C validator