Theorem xporderlem 6284

Description: Lemma for lexicographical ordering theorems. (Contributed by Scott Fenton, 16-Mar-2011.)

Hypothesis

Ref	Expression
xporderlem.1	|- T = { <. x , y >. | ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) /\ ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) ) }

Assertion

Ref	Expression
xporderlem	|- ( <. a , b >. T <. c , d >. <-> ( ( ( a e. A /\ c e. A ) /\ ( b e. B /\ d e. B ) ) /\ ( a R c \/ ( a = c /\ b S d ) ) ) )

Distinct variable groups:   x, A, y   x, B, y   x, R, y   x, S, y   x, a, y   x, b, y   x, c, y   x, d, y

Allowed substitution hints:   A( a, b, c, d)   B( a, b, c, d)   R( a, b, c, d)   S( a, b, c, d)   T( x, y, a, b, c, d)

Proof of Theorem xporderlem

Step	Hyp	Ref	Expression
1		df-br 4030	. . 3 |- ( <. a , b >. T <. c , d >. <-> <. <. a , b >. , <. c , d >. >. e. T )
2		xporderlem.1	. . . 4 |- T = { <. x , y >. | ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) /\ ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) ) }
3	2	eleq2i 2260	. . 3 |- ( <. <. a , b >. , <. c , d >. >. e. T <-> <. <. a , b >. , <. c , d >. >. e. { <. x , y >. | ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) /\ ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) ) } )
4	1, 3	bitri 184	. 2 |- ( <. a , b >. T <. c , d >. <-> <. <. a , b >. , <. c , d >. >. e. { <. x , y >. | ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) /\ ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) ) } )
5		vex 2763	. . . 4 |- a e. _V
6		vex 2763	. . . 4 |- b e. _V
7	5, 6	opex 4258	. . 3 |- <. a , b >. e. _V
8		vex 2763	. . . 4 |- c e. _V
9		vex 2763	. . . 4 |- d e. _V
10	8, 9	opex 4258	. . 3 |- <. c , d >. e. _V
11		eleq1 2256	. . . . . 6 |- ( x = <. a , b >. -> ( x e. ( A X. B ) <-> <. a , b >. e. ( A X. B ) ) )
12		opelxp 4689	. . . . . 6 |- ( <. a , b >. e. ( A X. B ) <-> ( a e. A /\ b e. B ) )
13	11, 12	bitrdi 196	. . . . 5 |- ( x = <. a , b >. -> ( x e. ( A X. B ) <-> ( a e. A /\ b e. B ) ) )
14	13	anbi1d 465	. . . 4 |- ( x = <. a , b >. -> ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) <-> ( ( a e. A /\ b e. B ) /\ y e. ( A X. B ) ) ) )
15	5, 6	op1std 6201	. . . . . 6 |- ( x = <. a , b >. -> ( 1st ` x ) = a )
16	15	breq1d 4039	. . . . 5 |- ( x = <. a , b >. -> ( ( 1st ` x ) R ( 1st ` y ) <-> a R ( 1st ` y ) ) )
17	15	eqeq1d 2202	. . . . . 6 |- ( x = <. a , b >. -> ( ( 1st ` x ) = ( 1st ` y ) <-> a = ( 1st ` y ) ) )
18	5, 6	op2ndd 6202	. . . . . . 7 |- ( x = <. a , b >. -> ( 2nd ` x ) = b )
19	18	breq1d 4039	. . . . . 6 |- ( x = <. a , b >. -> ( ( 2nd ` x ) S ( 2nd ` y ) <-> b S ( 2nd ` y ) ) )
20	17, 19	anbi12d 473	. . . . 5 |- ( x = <. a , b >. -> ( ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) <-> ( a = ( 1st ` y ) /\ b S ( 2nd ` y ) ) ) )
21	16, 20	orbi12d 794	. . . 4 |- ( x = <. a , b >. -> ( ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) <-> ( a R ( 1st ` y ) \/ ( a = ( 1st ` y ) /\ b S ( 2nd ` y ) ) ) ) )
22	14, 21	anbi12d 473	. . 3 |- ( x = <. a , b >. -> ( ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) /\ ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) ) <-> ( ( ( a e. A /\ b e. B ) /\ y e. ( A X. B ) ) /\ ( a R ( 1st ` y ) \/ ( a = ( 1st ` y ) /\ b S ( 2nd ` y ) ) ) ) ) )
23		eleq1 2256	. . . . . 6 |- ( y = <. c , d >. -> ( y e. ( A X. B ) <-> <. c , d >. e. ( A X. B ) ) )
24		opelxp 4689	. . . . . 6 |- ( <. c , d >. e. ( A X. B ) <-> ( c e. A /\ d e. B ) )
25	23, 24	bitrdi 196	. . . . 5 |- ( y = <. c , d >. -> ( y e. ( A X. B ) <-> ( c e. A /\ d e. B ) ) )
26	25	anbi2d 464	. . . 4 |- ( y = <. c , d >. -> ( ( ( a e. A /\ b e. B ) /\ y e. ( A X. B ) ) <-> ( ( a e. A /\ b e. B ) /\ ( c e. A /\ d e. B ) ) ) )
27	8, 9	op1std 6201	. . . . . 6 |- ( y = <. c , d >. -> ( 1st ` y ) = c )
28	27	breq2d 4041	. . . . 5 |- ( y = <. c , d >. -> ( a R ( 1st ` y ) <-> a R c ) )
29	27	eqeq2d 2205	. . . . . 6 |- ( y = <. c , d >. -> ( a = ( 1st ` y ) <-> a = c ) )
30	8, 9	op2ndd 6202	. . . . . . 7 |- ( y = <. c , d >. -> ( 2nd ` y ) = d )
31	30	breq2d 4041	. . . . . 6 |- ( y = <. c , d >. -> ( b S ( 2nd ` y ) <-> b S d ) )
32	29, 31	anbi12d 473	. . . . 5 |- ( y = <. c , d >. -> ( ( a = ( 1st ` y ) /\ b S ( 2nd ` y ) ) <-> ( a = c /\ b S d ) ) )
33	28, 32	orbi12d 794	. . . 4 |- ( y = <. c , d >. -> ( ( a R ( 1st ` y ) \/ ( a = ( 1st ` y ) /\ b S ( 2nd ` y ) ) ) <-> ( a R c \/ ( a = c /\ b S d ) ) ) )
34	26, 33	anbi12d 473	. . 3 |- ( y = <. c , d >. -> ( ( ( ( a e. A /\ b e. B ) /\ y e. ( A X. B ) ) /\ ( a R ( 1st ` y ) \/ ( a = ( 1st ` y ) /\ b S ( 2nd ` y ) ) ) ) <-> ( ( ( a e. A /\ b e. B ) /\ ( c e. A /\ d e. B ) ) /\ ( a R c \/ ( a = c /\ b S d ) ) ) ) )
35	7, 10, 22, 34	opelopab 4302	. 2 |- ( <. <. a , b >. , <. c , d >. >. e. { <. x , y >. | ( ( x e. ( A X. B ) /\ y e. ( A X. B ) ) /\ ( ( 1st ` x ) R ( 1st ` y ) \/ ( ( 1st ` x ) = ( 1st ` y ) /\ ( 2nd ` x ) S ( 2nd ` y ) ) ) ) } <-> ( ( ( a e. A /\ b e. B ) /\ ( c e. A /\ d e. B ) ) /\ ( a R c \/ ( a = c /\ b S d ) ) ) )
36		an4 586	. . 3 |- ( ( ( a e. A /\ b e. B ) /\ ( c e. A /\ d e. B ) ) <-> ( ( a e. A /\ c e. A ) /\ ( b e. B /\ d e. B ) ) )
37	36	anbi1i 458	. 2 |- ( ( ( ( a e. A /\ b e. B ) /\ ( c e. A /\ d e. B ) ) /\ ( a R c \/ ( a = c /\ b S d ) ) ) <-> ( ( ( a e. A /\ c e. A ) /\ ( b e. B /\ d e. B ) ) /\ ( a R c \/ ( a = c /\ b S d ) ) ) )
38	4, 35, 37	3bitri 206	1 |- ( <. a , b >. T <. c , d >. <-> ( ( ( a e. A /\ c e. A ) /\ ( b e. B /\ d e. B ) ) /\ ( a R c \/ ( a = c /\ b S d ) ) ) )

Syntax hints:   /\ wa 104   <-> wb 105   \/ wo 709   = wceq 1364   e. wcel 2164   <.cop 3621   class class class wbr 4029   {copab 4089   X. cxp 4657   ` cfv 5254   1stc1st 6191   2ndc2nd 6192

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-iota 5215  df-fun 5256  df-fv 5262  df-1st 6193  df-2nd 6194

This theorem is referenced by:  poxp  6285