![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wesn | Structured version Visualization version GIF version |
Description: Well-ordering of a singleton. (Contributed by Mario Carneiro, 28-Dec-2014.) |
Ref | Expression |
---|---|
wesn | ⊢ (Rel 𝑅 → (𝑅 We {𝐴} ↔ ¬ 𝐴𝑅𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frsn 5724 | . . 3 ⊢ (Rel 𝑅 → (𝑅 Fr {𝐴} ↔ ¬ 𝐴𝑅𝐴)) | |
2 | sosn 5723 | . . 3 ⊢ (Rel 𝑅 → (𝑅 Or {𝐴} ↔ ¬ 𝐴𝑅𝐴)) | |
3 | 1, 2 | anbi12d 632 | . 2 ⊢ (Rel 𝑅 → ((𝑅 Fr {𝐴} ∧ 𝑅 Or {𝐴}) ↔ (¬ 𝐴𝑅𝐴 ∧ ¬ 𝐴𝑅𝐴))) |
4 | df-we 5595 | . 2 ⊢ (𝑅 We {𝐴} ↔ (𝑅 Fr {𝐴} ∧ 𝑅 Or {𝐴})) | |
5 | pm4.24 565 | . 2 ⊢ (¬ 𝐴𝑅𝐴 ↔ (¬ 𝐴𝑅𝐴 ∧ ¬ 𝐴𝑅𝐴)) | |
6 | 3, 4, 5 | 3bitr4g 314 | 1 ⊢ (Rel 𝑅 → (𝑅 We {𝐴} ↔ ¬ 𝐴𝑅𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 {csn 4591 class class class wbr 5110 Or wor 5549 Fr wfr 5590 We wwe 5592 Rel wrel 5643 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2708 ax-sep 5261 ax-nul 5268 ax-pr 5389 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2715 df-cleq 2729 df-clel 2815 df-ne 2945 df-ral 3066 df-rex 3075 df-rab 3411 df-v 3450 df-dif 3918 df-un 3920 df-in 3922 df-ss 3932 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5173 df-po 5550 df-so 5551 df-fr 5593 df-we 5595 df-xp 5644 df-rel 5645 |
This theorem is referenced by: 0we1 8457 canthwe 10594 |
Copyright terms: Public domain | W3C validator |