Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  xporderlem Structured version   GIF version

Theorem xporderlem 5774
 Description: Lemma for lexicographical ordering theorems. (Contributed by Scott Fenton, 16-Mar-2011.)
Hypothesis
Ref Expression
xporderlem.1 𝑇 = {⟨x, y⟩ ∣ ((x (A × B) y (A × B)) ((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy))))}
Assertion
Ref Expression
xporderlem (⟨𝑎, 𝑏𝑇𝑐, 𝑑⟩ ↔ (((𝑎 A 𝑐 A) (𝑏 B 𝑑 B)) (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑))))
Distinct variable groups:   x,A,y   x,B,y   x,𝑅,y   x,𝑆,y   x,𝑎,y   x,𝑏,y   x,𝑐,y   x,𝑑,y
Allowed substitution hints:   A(𝑎,𝑏,𝑐,𝑑)   B(𝑎,𝑏,𝑐,𝑑)   𝑅(𝑎,𝑏,𝑐,𝑑)   𝑆(𝑎,𝑏,𝑐,𝑑)   𝑇(x,y,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem xporderlem
StepHypRef Expression
1 df-br 3739 . . 3 (⟨𝑎, 𝑏𝑇𝑐, 𝑑⟩ ↔ ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ 𝑇)
2 xporderlem.1 . . . 4 𝑇 = {⟨x, y⟩ ∣ ((x (A × B) y (A × B)) ((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy))))}
32eleq2i 2086 . . 3 (⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ 𝑇 ↔ ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ {⟨x, y⟩ ∣ ((x (A × B) y (A × B)) ((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy))))})
41, 3bitri 173 . 2 (⟨𝑎, 𝑏𝑇𝑐, 𝑑⟩ ↔ ⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ {⟨x, y⟩ ∣ ((x (A × B) y (A × B)) ((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy))))})
5 vex 2538 . . . 4 𝑎 V
6 vex 2538 . . . 4 𝑏 V
75, 6opex 3940 . . 3 𝑎, 𝑏 V
8 vex 2538 . . . 4 𝑐 V
9 vex 2538 . . . 4 𝑑 V
108, 9opex 3940 . . 3 𝑐, 𝑑 V
11 eleq1 2082 . . . . . 6 (x = ⟨𝑎, 𝑏⟩ → (x (A × B) ↔ ⟨𝑎, 𝑏 (A × B)))
12 opelxp 4301 . . . . . 6 (⟨𝑎, 𝑏 (A × B) ↔ (𝑎 A 𝑏 B))
1311, 12syl6bb 185 . . . . 5 (x = ⟨𝑎, 𝑏⟩ → (x (A × B) ↔ (𝑎 A 𝑏 B)))
1413anbi1d 441 . . . 4 (x = ⟨𝑎, 𝑏⟩ → ((x (A × B) y (A × B)) ↔ ((𝑎 A 𝑏 B) y (A × B))))
155, 6op1std 5698 . . . . . 6 (x = ⟨𝑎, 𝑏⟩ → (1stx) = 𝑎)
1615breq1d 3748 . . . . 5 (x = ⟨𝑎, 𝑏⟩ → ((1stx)𝑅(1sty) ↔ 𝑎𝑅(1sty)))
1715eqeq1d 2030 . . . . . 6 (x = ⟨𝑎, 𝑏⟩ → ((1stx) = (1sty) ↔ 𝑎 = (1sty)))
185, 6op2ndd 5699 . . . . . . 7 (x = ⟨𝑎, 𝑏⟩ → (2ndx) = 𝑏)
1918breq1d 3748 . . . . . 6 (x = ⟨𝑎, 𝑏⟩ → ((2ndx)𝑆(2ndy) ↔ 𝑏𝑆(2ndy)))
2017, 19anbi12d 445 . . . . 5 (x = ⟨𝑎, 𝑏⟩ → (((1stx) = (1sty) (2ndx)𝑆(2ndy)) ↔ (𝑎 = (1sty) 𝑏𝑆(2ndy))))
2116, 20orbi12d 694 . . . 4 (x = ⟨𝑎, 𝑏⟩ → (((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy))) ↔ (𝑎𝑅(1sty) (𝑎 = (1sty) 𝑏𝑆(2ndy)))))
2214, 21anbi12d 445 . . 3 (x = ⟨𝑎, 𝑏⟩ → (((x (A × B) y (A × B)) ((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy)))) ↔ (((𝑎 A 𝑏 B) y (A × B)) (𝑎𝑅(1sty) (𝑎 = (1sty) 𝑏𝑆(2ndy))))))
23 eleq1 2082 . . . . . 6 (y = ⟨𝑐, 𝑑⟩ → (y (A × B) ↔ ⟨𝑐, 𝑑 (A × B)))
24 opelxp 4301 . . . . . 6 (⟨𝑐, 𝑑 (A × B) ↔ (𝑐 A 𝑑 B))
2523, 24syl6bb 185 . . . . 5 (y = ⟨𝑐, 𝑑⟩ → (y (A × B) ↔ (𝑐 A 𝑑 B)))
2625anbi2d 440 . . . 4 (y = ⟨𝑐, 𝑑⟩ → (((𝑎 A 𝑏 B) y (A × B)) ↔ ((𝑎 A 𝑏 B) (𝑐 A 𝑑 B))))
278, 9op1std 5698 . . . . . 6 (y = ⟨𝑐, 𝑑⟩ → (1sty) = 𝑐)
2827breq2d 3750 . . . . 5 (y = ⟨𝑐, 𝑑⟩ → (𝑎𝑅(1sty) ↔ 𝑎𝑅𝑐))
2927eqeq2d 2033 . . . . . 6 (y = ⟨𝑐, 𝑑⟩ → (𝑎 = (1sty) ↔ 𝑎 = 𝑐))
308, 9op2ndd 5699 . . . . . . 7 (y = ⟨𝑐, 𝑑⟩ → (2ndy) = 𝑑)
3130breq2d 3750 . . . . . 6 (y = ⟨𝑐, 𝑑⟩ → (𝑏𝑆(2ndy) ↔ 𝑏𝑆𝑑))
3229, 31anbi12d 445 . . . . 5 (y = ⟨𝑐, 𝑑⟩ → ((𝑎 = (1sty) 𝑏𝑆(2ndy)) ↔ (𝑎 = 𝑐 𝑏𝑆𝑑)))
3328, 32orbi12d 694 . . . 4 (y = ⟨𝑐, 𝑑⟩ → ((𝑎𝑅(1sty) (𝑎 = (1sty) 𝑏𝑆(2ndy))) ↔ (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑))))
3426, 33anbi12d 445 . . 3 (y = ⟨𝑐, 𝑑⟩ → ((((𝑎 A 𝑏 B) y (A × B)) (𝑎𝑅(1sty) (𝑎 = (1sty) 𝑏𝑆(2ndy)))) ↔ (((𝑎 A 𝑏 B) (𝑐 A 𝑑 B)) (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑)))))
357, 10, 22, 34opelopab 3982 . 2 (⟨⟨𝑎, 𝑏⟩, ⟨𝑐, 𝑑⟩⟩ {⟨x, y⟩ ∣ ((x (A × B) y (A × B)) ((1stx)𝑅(1sty) ((1stx) = (1sty) (2ndx)𝑆(2ndy))))} ↔ (((𝑎 A 𝑏 B) (𝑐 A 𝑑 B)) (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑))))
36 an4 507 . . 3 (((𝑎 A 𝑏 B) (𝑐 A 𝑑 B)) ↔ ((𝑎 A 𝑐 A) (𝑏 B 𝑑 B)))
3736anbi1i 434 . 2 ((((𝑎 A 𝑏 B) (𝑐 A 𝑑 B)) (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑))) ↔ (((𝑎 A 𝑐 A) (𝑏 B 𝑑 B)) (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑))))
384, 35, 373bitri 195 1 (⟨𝑎, 𝑏𝑇𝑐, 𝑑⟩ ↔ (((𝑎 A 𝑐 A) (𝑏 B 𝑑 B)) (𝑎𝑅𝑐 (𝑎 = 𝑐 𝑏𝑆𝑑))))
 Colors of variables: wff set class Syntax hints:   ∧ wa 97   ↔ wb 98   ∨ wo 616   = wceq 1228   ∈ wcel 1374  ⟨cop 3353   class class class wbr 3738  {copab 3791   × cxp 4270  ‘cfv 4829  1st c1st 5688  2nd c2nd 5689 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-bnd 1380  ax-4 1381  ax-13 1385  ax-14 1386  ax-17 1400  ax-i9 1404  ax-ial 1409  ax-i5r 1410  ax-ext 2004  ax-sep 3849  ax-pow 3901  ax-pr 3918  ax-un 4120 This theorem depends on definitions:  df-bi 110  df-3an 875  df-tru 1231  df-nf 1330  df-sb 1628  df-eu 1885  df-mo 1886  df-clab 2009  df-cleq 2015  df-clel 2018  df-nfc 2149  df-ral 2289  df-rex 2290  df-v 2537  df-sbc 2742  df-un 2899  df-in 2901  df-ss 2908  df-pw 3336  df-sn 3356  df-pr 3357  df-op 3359  df-uni 3555  df-br 3739  df-opab 3793  df-mpt 3794  df-id 4004  df-xp 4278  df-rel 4279  df-cnv 4280  df-co 4281  df-dm 4282  df-rn 4283  df-iota 4794  df-fun 4831  df-fv 4837  df-1st 5690  df-2nd 5691 This theorem is referenced by:  poxp  5775
 Copyright terms: Public domain W3C validator