| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sosn | Structured version Visualization version GIF version | ||
| Description: Strict ordering on a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.) |
| Ref | Expression |
|---|---|
| sosn | ⊢ (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elsni 4599 | . . . . . 6 ⊢ (𝑥 ∈ {𝐴} → 𝑥 = 𝐴) | |
| 2 | elsni 4599 | . . . . . . 7 ⊢ (𝑦 ∈ {𝐴} → 𝑦 = 𝐴) | |
| 3 | 2 | eqcomd 2768 | . . . . . 6 ⊢ (𝑦 ∈ {𝐴} → 𝐴 = 𝑦) |
| 4 | 1, 3 | sylan9eq 2817 | . . . . 5 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → 𝑥 = 𝑦) |
| 5 | 4 | 3mix2d 1351 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} ∧ 𝑦 ∈ {𝐴}) → (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) |
| 6 | 5 | rgen2 3202 | . . 3 ⊢ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) |
| 7 | df-so 5556 | . . 3 ⊢ (𝑅 Or {𝐴} ↔ (𝑅 Po {𝐴} ∧ ∀𝑥 ∈ {𝐴}∀𝑦 ∈ {𝐴} (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))) | |
| 8 | 6, 7 | mpbiran2 720 | . 2 ⊢ (𝑅 Or {𝐴} ↔ 𝑅 Po {𝐴}) |
| 9 | posn 5733 | . 2 ⊢ (Rel 𝑅 → (𝑅 Po {𝐴} ↔ ¬ 𝐴𝑅𝐴)) | |
| 10 | 8, 9 | bitrid 285 | 1 ⊢ (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ w3o 1097 ∈ wcel 2142 ∀wral 3076 {csn 4582 class class class wbr 5100 Po wpo 5553 Or wor 5554 Rel wrel 5652 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 |
| This theorem is referenced by: wesn 5736 |
| Copyright terms: Public domain | W3C validator |