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

Theorem sosn 5345
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 4338 . . . . . 6 (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
2 elsni 4338 . . . . . . 7 (𝑦 ∈ {𝐴} → 𝑦 = 𝐴)
32eqcomd 2766 . . . . . 6 (𝑦 ∈ {𝐴} → 𝐴 = 𝑦)
41, 3sylan9eq 2814 . . . . 5 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → 𝑥 = 𝑦)
543mix2d 1422 . . . 4 ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
65rgen2a 3115 . . 3 𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)
7 df-so 5188 . . 3 (𝑅 Or {𝐴} ↔ (𝑅 Po {𝐴} ∧ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
86, 7mpbiran2 992 . 2 (𝑅 Or {𝐴} ↔ 𝑅 Po {𝐴})
9 posn 5344 . 2 (Rel 𝑅 → (𝑅 Po {𝐴} ↔ ¬ 𝐴𝑅𝐴))
108, 9syl5bb 272 1 (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 383  w3o 1071  wcel 2139  wral 3050  {csn 4321   class class class wbr 4804   Po wpo 5185   Or wor 5186  Rel wrel 5271
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pr 5055
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-sn 4322  df-pr 4324  df-op 4328  df-br 4805  df-opab 4865  df-po 5187  df-so 5188  df-xp 5272  df-rel 5273
This theorem is referenced by:  wesn  5347
  Copyright terms: Public domain W3C validator