ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  wefr Unicode version

Theorem wefr 4503
Description: A well-ordering is well-founded. (Contributed by NM, 22-Apr-1994.)
Assertion
Ref Expression
wefr  |-  ( R  We  A  ->  R  Fr  A )

Proof of Theorem wefr
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-wetr 4479 . 2  |-  ( R  We  A  <->  ( R  Fr  A  /\  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( (
x R y  /\  y R z )  ->  x R z ) ) )
21simplbi 274 1  |-  ( R  We  A  ->  R  Fr  A )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104   A.wral 2528   class class class wbr 4130    Fr wfr 4473    We wwe 4475
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106
This proof depends on definitions:  df-bi 117  df-wetr 4479
This theorem is used by:  wepo  4504  wetriext  4724
  Copyright terms: Public domain W3C validator