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

Theorem wefr 2191
Description: A well-ordering is founded.
Assertion
Ref Expression
wefr |- (R We A -> R Fr A)

Proof of Theorem wefr
StepHypRef Expression
1 df-we 2186 . 2 |- (R We A <-> (R Fr A /\ R Or A))
21pm3.26bd 259 1 |- (R We A -> R Fr A)
Colors of variables: wff set class
Syntax hints:   -> wi 2   Or wor 2059   Fr wfr 2061   We wwe 2062
This theorem is referenced by:  wefrc 2195  wereu 2197  ordfr 2214
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-an 198  df-we 2186
metamath.org