| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > wefr | GIF version | ||
| Description: A well-ordering is well-founded. (Contributed by NM, 22-Apr-1994.) | 
| Ref | Expression | 
|---|---|
| wefr | ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | df-wetr 4369 | . 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))) | |
| 2 | 1 | simplbi 274 | 1 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ∧ wa 104 ∀wral 2475 class class class wbr 4033 Fr wfr 4363 We wwe 4365 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 | 
| This theorem depends on definitions: df-bi 117 df-wetr 4369 | 
| This theorem is referenced by: wepo 4394 wetriext 4613 | 
| Copyright terms: Public domain | W3C validator |