Metamath Proof Explorer


Theorem dfso2

Description: Quantifier-free definition of a strict order. (Contributed by Scott Fenton, 22-Feb-2013)

Ref Expression
Assertion dfso2 ROrARPoAA×ARIR-1

Proof

Step Hyp Ref Expression
1 df-so ROrARPoAxAyAxRyx=yyRx
2 opelxp xyA×AxAyA
3 brun xIR-1yxIyxR-1y
4 vex yV
5 4 ideq xIyx=y
6 vex xV
7 6 4 brcnv xR-1yyRx
8 5 7 orbi12i xIyxR-1yx=yyRx
9 3 8 bitr2i x=yyRxxIR-1y
10 9 orbi2i xRyx=yyRxxRyxIR-1y
11 3orass xRyx=yyRxxRyx=yyRx
12 brun xRIR-1yxRyxIR-1y
13 10 11 12 3bitr4i xRyx=yyRxxRIR-1y
14 df-br xRIR-1yxyRIR-1
15 13 14 bitr2i xyRIR-1xRyx=yyRx
16 2 15 imbi12i xyA×AxyRIR-1xAyAxRyx=yyRx
17 16 2albii xyxyA×AxyRIR-1xyxAyAxRyx=yyRx
18 relxp RelA×A
19 ssrel RelA×AA×ARIR-1xyxyA×AxyRIR-1
20 18 19 ax-mp A×ARIR-1xyxyA×AxyRIR-1
21 r2al xAyAxRyx=yyRxxyxAyAxRyx=yyRx
22 17 20 21 3bitr4i A×ARIR-1xAyAxRyx=yyRx
23 22 anbi2i RPoAA×ARIR-1RPoAxAyAxRyx=yyRx
24 1 23 bitr4i ROrARPoAA×ARIR-1