MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-we Structured version   Visualization version   GIF version

Definition df-we 5613
Description: Define the well-ordering predicate. For an alternate definition, see dfwe2 7820. (Contributed by NM, 3-Apr-1994.)
Assertion
Ref Expression
df-we (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴))

Detailed syntax breakdown of Definition df-we
StepHypRef Expression
1 cA . . 3 class 𝐴
2 cR . . 3 class 𝑅
31, 2wwe 5610 . 2 wff 𝑅 We 𝐴
41, 2wfr 5608 . . 3 wff 𝑅 Fr 𝐴
51, 2wor 5565 . . 3 wff 𝑅 Or 𝐴
64, 5wa 401 . 2 wff (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴)
73, 6wb 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