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

Theorem 1sdom 9284
Description: A set that strictly dominates ordinal 1 has at least 2 different members. (Closely related to 2dom 9096.) (Contributed by Mario Carneiro, 12-Jan-2013.) Avoid ax-un 7783. (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 9283 . 2 (1o ≺ 𝐴 ↔ 2o ≼ 𝐴)
2 2dom 9096 . . 3 (2o ≼ 𝐴 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦)
3 df-ne 2960 . . . . . 6 (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦)
432rexbii 3142 . . . . 5 (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 𝑥 ≠ 𝑦 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 ¬ 𝑥 = 𝑦)
5 rex2dom 9282 . . . . 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 2147   ≠ wne 2959  ∃wrex 3090   class class class wbr 5108  1oc1o 8507  2oc2o 8508   ≼ cdom 9009   ≺ csdm 9010
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-1o 8514  df-2o 8515  df-en 9012  df-dom 9013  df-sdom 9014
This theorem is used by:  unxpdomlem3  9287  frgpnabl  20140  isnzr2  20819
  Copyright terms: Public domain W3C validator