![]() |
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 4089 | . 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))) | |
2 | 1 | simplbi 268 | 1 ⊢ (𝑅 We 𝐴 → 𝑅 Fr 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ∀wral 2348 class class class wbr 3785 Fr wfr 4083 We wwe 4085 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 |
This theorem depends on definitions: df-bi 115 df-wetr 4089 |
This theorem is referenced by: wepo 4114 wetriext 4319 |
Copyright terms: Public domain | W3C validator |