Theorem xporderlem 8059

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

Hypothesis

Ref	Expression
xporderlem.1	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))}

Assertion

Ref	Expression
xporderlem	⊢ (⟨𝑎, 𝑏⟩𝑇⟨𝑐, 𝑑⟩ ↔ (((𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑑 ∈ 𝐵)) ∧ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑))))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦   𝑥,𝑎,𝑦   𝑥,𝑏,𝑦   𝑥,𝑐,𝑦   𝑥,𝑑,𝑦

Allowed substitution hints:   𝐴(𝑎,𝑏,𝑐,𝑑)   𝐵(𝑎,𝑏,𝑐,𝑑)   𝑅(𝑎,𝑏,𝑐,𝑑)   𝑆(𝑎,𝑏,𝑐,𝑑)   𝑇(𝑥,𝑦,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem xporderlem

Step	Hyp	Ref	Expression
1		df-br 5106	. . 3 ⊢ (⟨𝑎, 𝑏⟩𝑇⟨𝑐, 𝑑⟩ ↔ ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∈ 𝑇)
2		xporderlem.1	. . . 4 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))}
3	2	eleq2i 2829	. . 3 ⊢ (⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∈ 𝑇 ↔ ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))})
4	1, 3	bitri 274	. 2 ⊢ (⟨𝑎, 𝑏⟩𝑇⟨𝑐, 𝑑⟩ ↔ ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))})
5		opex 5421	. . 3 ⊢ ⟨𝑎, 𝑏⟩ ∈ V
6		opex 5421	. . 3 ⊢ ⟨𝑐, 𝑑⟩ ∈ V
7		eleq1 2825	. . . . . 6 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝑥 ∈ (𝐴 × 𝐵) ↔ ⟨𝑎, 𝑏⟩ ∈ (𝐴 × 𝐵)))
8		opelxp 5669	. . . . . 6 ⊢ (⟨𝑎, 𝑏⟩ ∈ (𝐴 × 𝐵) ↔ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵))
9	7, 8	bitrdi 286	. . . . 5 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (𝑥 ∈ (𝐴 × 𝐵) ↔ (𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵)))
10	9	anbi1d 630	. . . 4 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵))))
11		vex 3449	. . . . . . 7 ⊢ 𝑎 ∈ V
12		vex 3449	. . . . . . 7 ⊢ 𝑏 ∈ V
13	11, 12	op1std 7931	. . . . . 6 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (1st ‘𝑥) = 𝑎)
14	13	breq1d 5115	. . . . 5 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → ((1st ‘𝑥)𝑅(1st ‘𝑦) ↔ 𝑎𝑅(1st ‘𝑦)))
15	13	eqeq1d 2738	. . . . . 6 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → ((1st ‘𝑥) = (1st ‘𝑦) ↔ 𝑎 = (1st ‘𝑦)))
16	11, 12	op2ndd 7932	. . . . . . 7 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (2nd ‘𝑥) = 𝑏)
17	16	breq1d 5115	. . . . . 6 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → ((2nd ‘𝑥)𝑆(2nd ‘𝑦) ↔ 𝑏𝑆(2nd ‘𝑦)))
18	15, 17	anbi12d 631	. . . . 5 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦)) ↔ (𝑎 = (1st ‘𝑦) ∧ 𝑏𝑆(2nd ‘𝑦))))
19	14, 18	orbi12d 917	. . . 4 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))) ↔ (𝑎𝑅(1st ‘𝑦) ∨ (𝑎 = (1st ‘𝑦) ∧ 𝑏𝑆(2nd ‘𝑦)))))
20	10, 19	anbi12d 631	. . 3 ⊢ (𝑥 = ⟨𝑎, 𝑏⟩ → (((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦)))) ↔ (((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ (𝑎𝑅(1st ‘𝑦) ∨ (𝑎 = (1st ‘𝑦) ∧ 𝑏𝑆(2nd ‘𝑦))))))
21		eleq1 2825	. . . . . 6 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (𝑦 ∈ (𝐴 × 𝐵) ↔ ⟨𝑐, 𝑑⟩ ∈ (𝐴 × 𝐵)))
22		opelxp 5669	. . . . . 6 ⊢ (⟨𝑐, 𝑑⟩ ∈ (𝐴 × 𝐵) ↔ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵))
23	21, 22	bitrdi 286	. . . . 5 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (𝑦 ∈ (𝐴 × 𝐵) ↔ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵)))
24	23	anbi2d 629	. . . 4 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵))))
25		vex 3449	. . . . . . 7 ⊢ 𝑐 ∈ V
26		vex 3449	. . . . . . 7 ⊢ 𝑑 ∈ V
27	25, 26	op1std 7931	. . . . . 6 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (1st ‘𝑦) = 𝑐)
28	27	breq2d 5117	. . . . 5 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (𝑎𝑅(1st ‘𝑦) ↔ 𝑎𝑅𝑐))
29	27	eqeq2d 2747	. . . . . 6 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (𝑎 = (1st ‘𝑦) ↔ 𝑎 = 𝑐))
30	25, 26	op2ndd 7932	. . . . . . 7 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (2nd ‘𝑦) = 𝑑)
31	30	breq2d 5117	. . . . . 6 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → (𝑏𝑆(2nd ‘𝑦) ↔ 𝑏𝑆𝑑))
32	29, 31	anbi12d 631	. . . . 5 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → ((𝑎 = (1st ‘𝑦) ∧ 𝑏𝑆(2nd ‘𝑦)) ↔ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑)))
33	28, 32	orbi12d 917	. . . 4 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → ((𝑎𝑅(1st ‘𝑦) ∨ (𝑎 = (1st ‘𝑦) ∧ 𝑏𝑆(2nd ‘𝑦))) ↔ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑))))
34	24, 33	anbi12d 631	. . 3 ⊢ (𝑦 = ⟨𝑐, 𝑑⟩ → ((((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ (𝑎𝑅(1st ‘𝑦) ∨ (𝑎 = (1st ‘𝑦) ∧ 𝑏𝑆(2nd ‘𝑦)))) ↔ (((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵)) ∧ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑)))))
35	5, 6, 20, 34	opelopab 5499	. 2 ⊢ (⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝑦 ∈ (𝐴 × 𝐵)) ∧ ((1st ‘𝑥)𝑅(1st ‘𝑦) ∨ ((1st ‘𝑥) = (1st ‘𝑦) ∧ (2nd ‘𝑥)𝑆(2nd ‘𝑦))))} ↔ (((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵)) ∧ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑))))
36		an4 654	. . 3 ⊢ (((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵)) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑑 ∈ 𝐵)))
37	36	anbi1i 624	. 2 ⊢ ((((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐵) ∧ (𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐵)) ∧ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑))) ↔ (((𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑑 ∈ 𝐵)) ∧ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑))))
38	4, 35, 37	3bitri 296	1 ⊢ (⟨𝑎, 𝑏⟩𝑇⟨𝑐, 𝑑⟩ ↔ (((𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐴) ∧ (𝑏 ∈ 𝐵 ∧ 𝑑 ∈ 𝐵)) ∧ (𝑎𝑅𝑐 ∨ (𝑎 = 𝑐 ∧ 𝑏𝑆𝑑))))

Syntax hints:   ↔ wb 205   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  ⟨cop 4592   class class class wbr 5105  {copab 5167   × cxp 5631  ‘cfv 6496  1^st c1st 7919  2^nd c2nd 7920

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-iota 6448  df-fun 6498  df-fv 6504  df-1st 7921  df-2nd 7922

This theorem is referenced by:  poxp  8060  soxp  8061