Metamath Proof Explorer


Theorem leop2

Description: Ordering relation for operators. Definition of operator ordering in Young p. 141. (Contributed by NM, 23-Jul-2006) (New usage is discouraged.)

Ref Expression
Assertion leop2 THrmOpUHrmOpTopUxTxihxUxihx

Proof

Step Hyp Ref Expression
1 leop THrmOpUHrmOpTopUx0U-opTxihx
2 hmopf THrmOpT:
3 hmopf UHrmOpU:
4 2 3 anim12i THrmOpUHrmOpT:U:
5 hodval U:T:xU-opTx=Ux-Tx
6 5 3com12 T:U:xU-opTx=Ux-Tx
7 6 3expa T:U:xU-opTx=Ux-Tx
8 7 oveq1d T:U:xU-opTxihx=Ux-Txihx
9 ffvelrn U:xUx
10 9 adantll T:U:xUx
11 ffvelrn T:xTx
12 11 adantlr T:U:xTx
13 simpr T:U:xx
14 his2sub UxTxxUx-Txihx=UxihxTxihx
15 10 12 13 14 syl3anc T:U:xUx-Txihx=UxihxTxihx
16 8 15 eqtrd T:U:xU-opTxihx=UxihxTxihx
17 4 16 sylan THrmOpUHrmOpxU-opTxihx=UxihxTxihx
18 17 breq2d THrmOpUHrmOpx0U-opTxihx0UxihxTxihx
19 hmopre UHrmOpxUxihx
20 19 adantll THrmOpUHrmOpxUxihx
21 hmopre THrmOpxTxihx
22 21 adantlr THrmOpUHrmOpxTxihx
23 20 22 subge0d THrmOpUHrmOpx0UxihxTxihxTxihxUxihx
24 18 23 bitrd THrmOpUHrmOpx0U-opTxihxTxihxUxihx
25 24 ralbidva THrmOpUHrmOpx0U-opTxihxxTxihxUxihx
26 1 25 bitrd THrmOpUHrmOpTopUxTxihxUxihx