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

Definition df-we 5075
Description: Define the well-ordering predicate. For an alternate definition, see dfwe2 6981. (Contributed by NM, 3-Apr-1994.)
Assertion
Ref Expression
df-we  |-  ( R  We  A  <->  ( R  Fr  A  /\  R  Or  A ) )

Detailed syntax breakdown of Definition df-we
StepHypRef Expression
1 cA . . 3  class  A
2 cR . . 3  class  R
31, 2wwe 5072 . 2  wff  R  We  A
41, 2wfr 5070 . . 3  wff  R  Fr  A
51, 2wor 5034 . . 3  wff  R  Or  A
64, 5wa 384 . 2  wff  ( R  Fr  A  /\  R  Or  A )
73, 6wb 196 1  wff  ( R  We  A  <->  ( R  Fr  A  /\  R  Or  A ) )
Colors of variables: wff setvar class
This definition is referenced by:  nfwe  5090  wess  5101  weeq1  5102  weeq2  5103  wefr  5104  weso  5105  we0  5109  weinxp  5186  wesn  5190  isowe  6599  isowe2  6600  dfwe2  6981  wexp  7291  wofi  8209  dford5reg  31687  fin2so  33396
  Copyright terms: Public domain W3C validator