Theorem sosn 5760

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 4644	. . . . . 6 ⊢ (𝑥 ∈ {𝐴} → 𝑥 = 𝐴)
2		elsni 4644	. . . . . . 7 ⊢ (𝑦 ∈ {𝐴} → 𝑦 = 𝐴)
3	2	eqcomd 2738	. . . . . 6 ⊢ (𝑦 ∈ {𝐴} → 𝐴 = 𝑦)
4	1, 3	sylan9eq 2792	. . . . 5 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → 𝑥 = 𝑦)
5	4	3mix2d 1337	. . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
6	5	rgen2 3197	. . 3 ⊢ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)
7		df-so 5588	. . 3 ⊢ (𝑅 Or {𝐴} ↔ (𝑅 Po {𝐴} ∧ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
8	6, 7	mpbiran2 708	. 2 ⊢ (𝑅 Or {𝐴} ↔ 𝑅 Po {𝐴})
9		posn 5759	. 2 ⊢ (Rel 𝑅 → (𝑅 Po {𝐴} ↔ ¬ 𝐴𝑅𝐴))
10	8, 9	bitrid 282	1 ⊢ (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∨ w3o 1086   ∈ wcel 2106  ∀wral 3061  {csn 4627   class class class wbr 5147   Po wpo 5585   Or wor 5586  Rel wrel 5680

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-br 5148  df-opab 5210  df-po 5587  df-so 5588  df-xp 5681  df-rel 5682

This theorem is referenced by:  wesn  5762