MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  wemaplem1 Structured version   Unicode version

Theorem wemaplem1 7989
Description: Value of the lexicographic order on a sequence space. (Contributed by Stefan O'Rear, 18-Jan-2015.)
Hypothesis
Ref Expression
wemapso.t  |-  T  =  { <. x ,  y
>.  |  E. z  e.  A  ( (
x `  z ) S ( y `  z )  /\  A. w  e.  A  (
w R z  -> 
( x `  w
)  =  ( y `
 w ) ) ) }
Assertion
Ref Expression
wemaplem1  |-  ( ( P  e.  V  /\  Q  e.  W )  ->  ( P T Q  <->  E. a  e.  A  ( ( P `  a ) S ( Q `  a )  /\  A. b  e.  A  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) ) ) )
Distinct variable groups:    a, b, x    T, a, b    w, a, y, z, b, x, A    P, a, b, w, x, y, z    Q, a, b, w, x, y, z    R, a, b, w, x, y, z    S, a, b, w, x, y, z
Allowed substitution hints:    T( x, y, z, w)    V( x, y, z, w, a, b)    W( x, y, z, w, a, b)

Proof of Theorem wemaplem1
StepHypRef Expression
1 fveq1 5871 . . . . . 6  |-  ( x  =  P  ->  (
x `  z )  =  ( P `  z ) )
2 fveq1 5871 . . . . . 6  |-  ( y  =  Q  ->  (
y `  z )  =  ( Q `  z ) )
31, 2breqan12d 4471 . . . . 5  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( ( x `  z ) S ( y `  z )  <-> 
( P `  z
) S ( Q `
 z ) ) )
4 fveq1 5871 . . . . . . . 8  |-  ( x  =  P  ->  (
x `  w )  =  ( P `  w ) )
5 fveq1 5871 . . . . . . . 8  |-  ( y  =  Q  ->  (
y `  w )  =  ( Q `  w ) )
64, 5eqeqan12d 2480 . . . . . . 7  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( ( x `  w )  =  ( y `  w )  <-> 
( P `  w
)  =  ( Q `
 w ) ) )
76imbi2d 316 . . . . . 6  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( ( w R z  ->  ( x `  w )  =  ( y `  w ) )  <->  ( w R z  ->  ( P `  w )  =  ( Q `  w ) ) ) )
87ralbidv 2896 . . . . 5  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( A. w  e.  A  ( w R z  ->  ( x `  w )  =  ( y `  w ) )  <->  A. w  e.  A  ( w R z  ->  ( P `  w )  =  ( Q `  w ) ) ) )
93, 8anbi12d 710 . . . 4  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( ( ( x `
 z ) S ( y `  z
)  /\  A. w  e.  A  ( w R z  ->  (
x `  w )  =  ( y `  w ) ) )  <-> 
( ( P `  z ) S ( Q `  z )  /\  A. w  e.  A  ( w R z  ->  ( P `  w )  =  ( Q `  w ) ) ) ) )
109rexbidv 2968 . . 3  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( E. z  e.  A  ( ( x `
 z ) S ( y `  z
)  /\  A. w  e.  A  ( w R z  ->  (
x `  w )  =  ( y `  w ) ) )  <->  E. z  e.  A  ( ( P `  z ) S ( Q `  z )  /\  A. w  e.  A  ( w R z  ->  ( P `  w )  =  ( Q `  w ) ) ) ) )
11 fveq2 5872 . . . . . 6  |-  ( z  =  a  ->  ( P `  z )  =  ( P `  a ) )
12 fveq2 5872 . . . . . 6  |-  ( z  =  a  ->  ( Q `  z )  =  ( Q `  a ) )
1311, 12breq12d 4469 . . . . 5  |-  ( z  =  a  ->  (
( P `  z
) S ( Q `
 z )  <->  ( P `  a ) S ( Q `  a ) ) )
14 breq2 4460 . . . . . . . 8  |-  ( z  =  a  ->  (
w R z  <->  w R
a ) )
1514imbi1d 317 . . . . . . 7  |-  ( z  =  a  ->  (
( w R z  ->  ( P `  w )  =  ( Q `  w ) )  <->  ( w R a  ->  ( P `  w )  =  ( Q `  w ) ) ) )
1615ralbidv 2896 . . . . . 6  |-  ( z  =  a  ->  ( A. w  e.  A  ( w R z  ->  ( P `  w )  =  ( Q `  w ) )  <->  A. w  e.  A  ( w R a  ->  ( P `  w )  =  ( Q `  w ) ) ) )
17 breq1 4459 . . . . . . . 8  |-  ( w  =  b  ->  (
w R a  <->  b R
a ) )
18 fveq2 5872 . . . . . . . . 9  |-  ( w  =  b  ->  ( P `  w )  =  ( P `  b ) )
19 fveq2 5872 . . . . . . . . 9  |-  ( w  =  b  ->  ( Q `  w )  =  ( Q `  b ) )
2018, 19eqeq12d 2479 . . . . . . . 8  |-  ( w  =  b  ->  (
( P `  w
)  =  ( Q `
 w )  <->  ( P `  b )  =  ( Q `  b ) ) )
2117, 20imbi12d 320 . . . . . . 7  |-  ( w  =  b  ->  (
( w R a  ->  ( P `  w )  =  ( Q `  w ) )  <->  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) ) )
2221cbvralv 3084 . . . . . 6  |-  ( A. w  e.  A  (
w R a  -> 
( P `  w
)  =  ( Q `
 w ) )  <->  A. b  e.  A  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) )
2316, 22syl6bb 261 . . . . 5  |-  ( z  =  a  ->  ( A. w  e.  A  ( w R z  ->  ( P `  w )  =  ( Q `  w ) )  <->  A. b  e.  A  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) ) )
2413, 23anbi12d 710 . . . 4  |-  ( z  =  a  ->  (
( ( P `  z ) S ( Q `  z )  /\  A. w  e.  A  ( w R z  ->  ( P `  w )  =  ( Q `  w ) ) )  <->  ( ( P `  a ) S ( Q `  a )  /\  A. b  e.  A  (
b R a  -> 
( P `  b
)  =  ( Q `
 b ) ) ) ) )
2524cbvrexv 3085 . . 3  |-  ( E. z  e.  A  ( ( P `  z
) S ( Q `
 z )  /\  A. w  e.  A  ( w R z  -> 
( P `  w
)  =  ( Q `
 w ) ) )  <->  E. a  e.  A  ( ( P `  a ) S ( Q `  a )  /\  A. b  e.  A  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) ) )
2610, 25syl6bb 261 . 2  |-  ( ( x  =  P  /\  y  =  Q )  ->  ( E. z  e.  A  ( ( x `
 z ) S ( y `  z
)  /\  A. w  e.  A  ( w R z  ->  (
x `  w )  =  ( y `  w ) ) )  <->  E. a  e.  A  ( ( P `  a ) S ( Q `  a )  /\  A. b  e.  A  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) ) ) )
27 wemapso.t . 2  |-  T  =  { <. x ,  y
>.  |  E. z  e.  A  ( (
x `  z ) S ( y `  z )  /\  A. w  e.  A  (
w R z  -> 
( x `  w
)  =  ( y `
 w ) ) ) }
2826, 27brabga 4770 1  |-  ( ( P  e.  V  /\  Q  e.  W )  ->  ( P T Q  <->  E. a  e.  A  ( ( P `  a ) S ( Q `  a )  /\  A. b  e.  A  ( b R a  ->  ( P `  b )  =  ( Q `  b ) ) ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1395    e. wcel 1819   A.wral 2807   E.wrex 2808   class class class wbr 4456   {copab 4514   ` cfv 5594
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-sep 4578  ax-nul 4586  ax-pr 4695
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-nul 3794  df-if 3945  df-sn 4033  df-pr 4035  df-op 4039  df-uni 4252  df-br 4457  df-opab 4516  df-iota 5557  df-fv 5602
This theorem is referenced by:  wemaplem2  7990  wemaplem3  7991  wemappo  7992  wemapsolem  7993
  Copyright terms: Public domain W3C validator