![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
Mirrors > Home > MPE Home > Th. List > or32 | Unicode version |
Description: A rearrangement of disjuncts. (Contributed by NM, 18-Oct-1995.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
Ref | Expression |
---|---|
or32 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | orass 524 | . 2 | |
2 | or12 523 | . 2 | |
3 | orcom 387 | . 2 | |
4 | 1, 2, 3 | 3bitri 271 | 1 |
Colors of variables: wff setvar class |
Syntax hints: <-> wb 184 \/ wo 368 |
This theorem is referenced by: sspsstri 3605 somo 4839 ordtri3 4919 psslinpr 9430 xrnepnf 11358 xrinfmss 11530 tosso 15666 lineunray 29797 or32dd 30494 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 185 df-or 370 |
Copyright terms: Public domain | W3C validator |