Metamath Proof Explorer


Theorem epweon

Description: The membership relation well-orders the class of ordinal numbers. This proof does not require the axiom of regularity. Proposition 4.8(g) of Mendelson p. 244. (Contributed by NM, 1-Nov-2003) Avoid ax-un . (Revised by BTernaryTau, 30-Nov-2024)

Ref Expression
Assertion epweon EWeOn

Proof

Step Hyp Ref Expression
1 onfr EFrOn
2 df-po EPoOnxOnyOnzOn¬xExxEyyEzxEz
3 eloni xOnOrdx
4 ordirr Ordx¬xx
5 3 4 syl xOn¬xx
6 epel xExxx
7 5 6 sylnibr xOn¬xEx
8 ontr1 zOnxyyzxz
9 epel xEyxy
10 epel yEzyz
11 9 10 anbi12i xEyyEzxyyz
12 epel xEzxz
13 8 11 12 3imtr4g zOnxEyyEzxEz
14 7 13 anim12i xOnzOn¬xExxEyyEzxEz
15 14 ralrimiva xOnzOn¬xExxEyyEzxEz
16 15 ralrimivw xOnyOnzOn¬xExxEyyEzxEz
17 2 16 mprgbir EPoOn
18 eloni yOnOrdy
19 ordtri3or OrdxOrdyxyx=yyx
20 biid x=yx=y
21 epel yExyx
22 9 20 21 3orbi123i xEyx=yyExxyx=yyx
23 19 22 sylibr OrdxOrdyxEyx=yyEx
24 3 18 23 syl2an xOnyOnxEyx=yyEx
25 24 rgen2 xOnyOnxEyx=yyEx
26 df-so EOrOnEPoOnxOnyOnxEyx=yyEx
27 17 25 26 mpbir2an EOrOn
28 df-we EWeOnEFrOnEOrOn
29 1 27 28 mpbir2an EWeOn