![]() |
Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > dford5reg | Structured version Visualization version GIF version |
Description: Given ax-reg 9040, an ordinal is a transitive class totally ordered by the membership relation. (Contributed by Scott Fenton, 28-Jan-2011.) |
Ref | Expression |
---|---|
dford5reg | ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E Or 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ord 6162 | . 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴)) | |
2 | zfregfr 9052 | . . . 4 ⊢ E Fr 𝐴 | |
3 | df-we 5480 | . . . 4 ⊢ ( E We 𝐴 ↔ ( E Fr 𝐴 ∧ E Or 𝐴)) | |
4 | 2, 3 | mpbiran 708 | . . 3 ⊢ ( E We 𝐴 ↔ E Or 𝐴) |
5 | 4 | anbi2i 625 | . 2 ⊢ ((Tr 𝐴 ∧ E We 𝐴) ↔ (Tr 𝐴 ∧ E Or 𝐴)) |
6 | 1, 5 | bitri 278 | 1 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E Or 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 Tr wtr 5136 E cep 5429 Or wor 5437 Fr wfr 5475 We wwe 5477 Ord word 6158 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-reg 9040 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-eprel 5430 df-fr 5478 df-we 5480 df-ord 6162 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |