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 5614
Description: Define the well-ordering predicate. For an alternate definition, see dfwe2 7777. (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 5611 . 2 wff 𝑅 We 𝐴
41, 2wfr 5609 . . 3 wff 𝑅 Fr 𝐴
51, 2wor 5566 . . 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  5634  wess  5645  weeq1  5646  weeq2  5647  wefr  5649  weso  5650  we0  5654  weinxp  5744  wesn  5748  isowe  7354  isowe2  7355  dfwe2  7777  epweon  7778  wexp  8132  wofi  9263  dford5reg  36367  weiunwe  37096  finorwe  38144  fin2so  38369
  Copyright terms: Public domain W3C validator