![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wetrep | Structured version Visualization version GIF version |
Description: An epsilon well-ordering is a transitive relation. (Contributed by NM, 22-Apr-1994.) |
Ref | Expression |
---|---|
wetrep | ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | weso 5303 | . . 3 ⊢ ( E We 𝐴 → E Or 𝐴) | |
2 | sotr 5255 | . . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) | |
3 | 1, 2 | sylan 576 | . 2 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)) |
4 | epel 5228 | . . 3 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦) | |
5 | epel 5228 | . . 3 ⊢ (𝑦 E 𝑧 ↔ 𝑦 ∈ 𝑧) | |
6 | 4, 5 | anbi12i 621 | . 2 ⊢ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧)) |
7 | epel 5228 | . 2 ⊢ (𝑥 E 𝑧 ↔ 𝑥 ∈ 𝑧) | |
8 | 3, 6, 7 | 3imtr3g 287 | 1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 385 ∧ w3a 1108 ∈ wcel 2157 class class class wbr 4843 E cep 5224 Or wor 5232 We wwe 5270 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-sep 4975 ax-nul 4983 ax-pr 5097 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-ral 3094 df-rab 3098 df-v 3387 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-sn 4369 df-pr 4371 df-op 4375 df-br 4844 df-opab 4906 df-eprel 5225 df-po 5233 df-so 5234 df-we 5273 |
This theorem is referenced by: wefrc 5306 ordelord 5963 |
Copyright terms: Public domain | W3C validator |