HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  stcltr1i Structured version   Unicode version

Theorem stcltr1i 25697
Description: Property of a strong classical state. (Contributed by NM, 24-Oct-1999.) (New usage is discouraged.)
Hypotheses
Ref Expression
stcltr1.1  |-  ( ph  <->  ( S  e.  States  /\  A. x  e.  CH  A. y  e.  CH  ( ( ( S `  x )  =  1  ->  ( S `  y )  =  1 )  ->  x  C_  y ) ) )
stcltr1.2  |-  A  e. 
CH
stcltr1.3  |-  B  e. 
CH
Assertion
Ref Expression
stcltr1i  |-  ( ph  ->  ( ( ( S `
 A )  =  1  ->  ( S `  B )  =  1 )  ->  A  C_  B
) )
Distinct variable groups:    x, y, A    x, B, y    x, S, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem stcltr1i
StepHypRef Expression
1 stcltr1.1 . 2  |-  ( ph  <->  ( S  e.  States  /\  A. x  e.  CH  A. y  e.  CH  ( ( ( S `  x )  =  1  ->  ( S `  y )  =  1 )  ->  x  C_  y ) ) )
2 stcltr1.2 . . . 4  |-  A  e. 
CH
3 stcltr1.3 . . . 4  |-  B  e. 
CH
4 fveq2 5710 . . . . . . . 8  |-  ( x  =  A  ->  ( S `  x )  =  ( S `  A ) )
54eqeq1d 2451 . . . . . . 7  |-  ( x  =  A  ->  (
( S `  x
)  =  1  <->  ( S `  A )  =  1 ) )
65imbi1d 317 . . . . . 6  |-  ( x  =  A  ->  (
( ( S `  x )  =  1  ->  ( S `  y )  =  1 )  <->  ( ( S `
 A )  =  1  ->  ( S `  y )  =  1 ) ) )
7 sseq1 3396 . . . . . 6  |-  ( x  =  A  ->  (
x  C_  y  <->  A  C_  y
) )
86, 7imbi12d 320 . . . . 5  |-  ( x  =  A  ->  (
( ( ( S `
 x )  =  1  ->  ( S `  y )  =  1 )  ->  x  C_  y
)  <->  ( ( ( S `  A )  =  1  ->  ( S `  y )  =  1 )  ->  A  C_  y ) ) )
9 fveq2 5710 . . . . . . . 8  |-  ( y  =  B  ->  ( S `  y )  =  ( S `  B ) )
109eqeq1d 2451 . . . . . . 7  |-  ( y  =  B  ->  (
( S `  y
)  =  1  <->  ( S `  B )  =  1 ) )
1110imbi2d 316 . . . . . 6  |-  ( y  =  B  ->  (
( ( S `  A )  =  1  ->  ( S `  y )  =  1 )  <->  ( ( S `
 A )  =  1  ->  ( S `  B )  =  1 ) ) )
12 sseq2 3397 . . . . . 6  |-  ( y  =  B  ->  ( A  C_  y  <->  A  C_  B
) )
1311, 12imbi12d 320 . . . . 5  |-  ( y  =  B  ->  (
( ( ( S `
 A )  =  1  ->  ( S `  y )  =  1 )  ->  A  C_  y
)  <->  ( ( ( S `  A )  =  1  ->  ( S `  B )  =  1 )  ->  A  C_  B ) ) )
148, 13rspc2v 3098 . . . 4  |-  ( ( A  e.  CH  /\  B  e.  CH )  ->  ( A. x  e. 
CH  A. y  e.  CH  ( ( ( S `
 x )  =  1  ->  ( S `  y )  =  1 )  ->  x  C_  y
)  ->  ( (
( S `  A
)  =  1  -> 
( S `  B
)  =  1 )  ->  A  C_  B
) ) )
152, 3, 14mp2an 672 . . 3  |-  ( A. x  e.  CH  A. y  e.  CH  ( ( ( S `  x )  =  1  ->  ( S `  y )  =  1 )  ->  x  C_  y )  -> 
( ( ( S `
 A )  =  1  ->  ( S `  B )  =  1 )  ->  A  C_  B
) )
1615adantl 466 . 2  |-  ( ( S  e.  States  /\  A. x  e.  CH  A. y  e.  CH  ( ( ( S `  x )  =  1  ->  ( S `  y )  =  1 )  ->  x  C_  y ) )  ->  ( ( ( S `  A )  =  1  ->  ( S `  B )  =  1 )  ->  A  C_  B ) )
171, 16sylbi 195 1  |-  ( ph  ->  ( ( ( S `
 A )  =  1  ->  ( S `  B )  =  1 )  ->  A  C_  B
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    = wceq 1369    e. wcel 1756   A.wral 2734    C_ wss 3347   ` cfv 5437   1c1 9302   CHcch 24350   Statescst 24383
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2577  df-ral 2739  df-rex 2740  df-rab 2743  df-v 2993  df-dif 3350  df-un 3352  df-in 3354  df-ss 3361  df-nul 3657  df-if 3811  df-sn 3897  df-pr 3899  df-op 3903  df-uni 4111  df-br 4312  df-iota 5400  df-fv 5445
This theorem is referenced by:  stcltr2i  25698  stcltrlem2  25700
  Copyright terms: Public domain W3C validator