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

Theorem sosn 5111
 Description: Strict ordering on a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.)
Assertion
Ref Expression
sosn (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴))

Proof of Theorem sosn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elsni 4142 . . . . . 6 (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
2 elsni 4142 . . . . . . 7 (𝑦 ∈ {𝐴} → 𝑦 = 𝐴)
32eqcomd 2616 . . . . . 6 (𝑦 ∈ {𝐴} → 𝐴 = 𝑦)
41, 3sylan9eq 2664 . . . . 5 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → 𝑥 = 𝑦)
543mix2d 1230 . . . 4 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
65rgen2a 2960 . . 3 𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)
7 df-so 4960 . . 3 (𝑅 Or {𝐴} ↔ (𝑅 Po {𝐴} ∧ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
86, 7mpbiran2 956 . 2 (𝑅 Or {𝐴} ↔ 𝑅 Po {𝐴})
9 posn 5110 . 2 (Rel 𝑅 → (𝑅 Po {𝐴} ↔ ¬ 𝐴𝑅𝐴))
108, 9syl5bb 271 1 (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 195   ∧ wa 383   ∨ w3o 1030   ∈ wcel 1977  ∀wral 2896  {csn 4125   class class class wbr 4583   Po wpo 4957   Or wor 4958  Rel wrel 5043 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-po 4959  df-so 4960  df-xp 5044  df-rel 5045 This theorem is referenced by:  wesn  5113
 Copyright terms: Public domain W3C validator