HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Definition df-we 2186
Description: Define a well-ordering. For an alternate definition see dfwe2 2187.
Assertion
Ref Expression
df-we (R We A ↔ (R Fr AR Or A))

Detailed syntax breakdown of Definition df-we
StepHypRef Expression
1 cA . . 3 class A
2 cR . . 3 class R
31, 2wwe 2062 . 2 wff R We A
41, 2wfr 2061 . . 3 wff R Fr A
51, 2wor 2059 . . 3 wff R Or A
64, 5wa 196 . 2 wff (R Fr AR Or A)
73, 6wb 127 1 wff (R We A ↔ (R Fr AR Or A))
Colors of variables: wff set class
This definition is referenced by:  dfwe2 2187  wess 2188  weeq1 2189  weeq2 2190  wefr 2191  weso 2192  we0 2196
metamath.org