| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > df-we | Structured version Visualization version GIF version | ||
| Description: Define the well-ordering predicate. For an alternate definition, see dfwe2 7820. (Contributed by NM, 3-Apr-1994.) |
| Ref | Expression |
|---|---|
| df-we | ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cA | . . 3 class 𝐴 | |
| 2 | cR | . . 3 class 𝑅 | |
| 3 | 1, 2 | wwe 5610 | . 2 wff 𝑅 We 𝐴 |
| 4 | 1, 2 | wfr 5608 | . . 3 wff 𝑅 Fr 𝐴 |
| 5 | 1, 2 | wor 5565 | . . 3 wff 𝑅 Or 𝐴 |
| 6 | 4, 5 | wa 401 | . 2 wff (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) |
| 7 | 3, 6 | wb 209 | 1 wff (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴)) |
| Colors of variables: wff setvar class |
| This definition is used by: nfwe 5633 wess 5644 weeq1 5645 weeq2 5646 wefr 5648 weso 5649 we0 5653 weinxp 5744 wesn 5748 isowe 7388 isowe2 7389 dfwe2 7820 epweon 7821 wexp 8179 wofi 9318 dford5reg 36759 weiunwe 37472 finorwe 38573 fin2so 38798 |
| Copyright terms: Public domain | W3C validator |