Theorem leord1 10555

Description: Infer an ordering relation from a proof in only one direction. (Contributed by Mario Carneiro, 14-Jun-2014.)

Hypotheses

Ref	Expression
ltord.1	|- ( x = y -> A = B )
ltord.2	|- ( x = C -> A = M )
ltord.3	|- ( x = D -> A = N )
ltord.4	|- S C_ RR
ltord.5	|- ( ( ph /\ x e. S ) -> A e. RR )
ltord.6	|- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x < y -> A < B ) )

Assertion

Ref	Expression
leord1	|- ( ( ph /\ ( C e. S /\ D e. S ) ) -> ( C <_ D <-> M <_ N ) )

Distinct variable groups:   x, B   x, y, C   x, D, y   x, M, y   x, N, y   ph, x, y   x, S, y

Allowed substitution hints:   A( x, y)   B( y)

Proof of Theorem leord1

Step	Hyp	Ref	Expression
1		ltord.1	. . . . 5 |- ( x = y -> A = B )
2		ltord.3	. . . . 5 |- ( x = D -> A = N )
3		ltord.2	. . . . 5 |- ( x = C -> A = M )
4		ltord.4	. . . . 5 |- S C_ RR
5		ltord.5	. . . . 5 |- ( ( ph /\ x e. S ) -> A e. RR )
6		ltord.6	. . . . 5 |- ( ( ph /\ ( x e. S /\ y e. S ) ) -> ( x < y -> A < B ) )
7	1, 2, 3, 4, 5, 6	ltord1 10554	. . . 4 |- ( ( ph /\ ( D e. S /\ C e. S ) ) -> ( D < C <-> N < M ) )
8	7	ancom2s 844	. . 3 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> ( D < C <-> N < M ) )
9	8	notbid 308	. 2 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> ( -. D < C <-> -. N < M ) )
10	4	sseli 3599	. . . 4 |- ( C e. S -> C e. RR )
11	4	sseli 3599	. . . 4 |- ( D e. S -> D e. RR )
12		lenlt 10116	. . . 4 |- ( ( C e. RR /\ D e. RR ) -> ( C <_ D <-> -. D < C ) )
13	10, 11, 12	syl2an 494	. . 3 |- ( ( C e. S /\ D e. S ) -> ( C <_ D <-> -. D < C ) )
14	13	adantl 482	. 2 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> ( C <_ D <-> -. D < C ) )
15	5	ralrimiva 2966	. . . . 5 |- ( ph -> A. x e. S A e. RR )
16	3	eleq1d 2686	. . . . . 6 |- ( x = C -> ( A e. RR <-> M e. RR ) )
17	16	rspccva 3308	. . . . 5 |- ( ( A. x e. S A e. RR /\ C e. S ) -> M e. RR )
18	15, 17	sylan 488	. . . 4 |- ( ( ph /\ C e. S ) -> M e. RR )
19	18	adantrr 753	. . 3 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> M e. RR )
20	2	eleq1d 2686	. . . . . 6 |- ( x = D -> ( A e. RR <-> N e. RR ) )
21	20	rspccva 3308	. . . . 5 |- ( ( A. x e. S A e. RR /\ D e. S ) -> N e. RR )
22	15, 21	sylan 488	. . . 4 |- ( ( ph /\ D e. S ) -> N e. RR )
23	22	adantrl 752	. . 3 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> N e. RR )
24	19, 23	lenltd 10183	. 2 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> ( M <_ N <-> -. N < M ) )
25	9, 14, 24	3bitr4d 300	1 |- ( ( ph /\ ( C e. S /\ D e. S ) ) -> ( C <_ D <-> M <_ N ) )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 196   /\ wa 384   = wceq 1483   e. wcel 1990   A.wral 2912   C_ wss 3574   class class class wbr 4653   RRcr 9935   < clt 10074   <_ cle 10075

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-resscn 9993  ax-pre-lttri 10010

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-pnf 10076  df-mnf 10077  df-xr 10078  df-ltxr 10079  df-le 10080

This theorem is referenced by:  eqord1  10556  leord2  10558  lermxnn0  37517  lermy  37522