Theorem sosn 5749

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.

Step	Hyp	Ref	Expression
1		elsni 4611	. . . . . 6 ⊢ (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
2		elsni 4611	. . . . . . 7 ⊢ (𝑦 ∈ {𝐴} → 𝑦 = 𝐴)
3	2	eqcomd 2775	. . . . . 6 ⊢ (𝑦 ∈ {𝐴} → 𝐴 = 𝑦)
4	1, 3	sylan9eq 2824	. . . . 5 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → 𝑥 = 𝑦)
5	4	3mix2d 1354	. . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
6	5	rgen2 3211	. . 3 ⊢ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)
7		df-so 5571	. . 3 ⊢ (𝑅 Or {𝐴} ↔ (𝑅 Po {𝐴} ∧ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
8	6, 7	mpbiran2 722	. 2 ⊢ (𝑅 Or {𝐴} ↔ 𝑅 Po {𝐴})
9		posn 5748	. 2 ⊢ (Rel 𝑅 → (𝑅 Po {𝐴} ↔ ¬ 𝐴𝑅𝐴))
10	8, 9	bitrid 286	1 ⊢ (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ w3o 1100   ∈ wcel 2149  ∀wral 3085  {csn 4594   class class class wbr 5113   Po wpo 5568   Or wor 5569  Rel wrel 5667

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-po 5570  df-so 5571  df-xp 5668  df-rel 5669

This theorem is referenced by:  wesn  5751