Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme31so Structured version   Visualization version   Unicode version

Theorem cdleme31so 35667
Description: Part of proof of Lemma E in [Crawley] p. 113. (Contributed by NM, 25-Feb-2013.)
Hypotheses
Ref Expression
cdleme31so.o  |-  O  =  ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) ) )
cdleme31so.c  |-  C  =  ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) )
Assertion
Ref Expression
cdleme31so  |-  ( X  e.  B  ->  [_ X  /  x ]_ O  =  C )
Distinct variable groups:    x, A    x, B    x,  .\/    x,  .<_    x,  ./\    x, N    x, s, z, X    x, W
Allowed substitution hints:    A( z, s)    B( z, s)    C( x, z, s)    .\/ ( z, s)    .<_ ( z, s)    ./\ ( z, s)    N( z, s)    O( x, z, s)    W( z, s)

Proof of Theorem cdleme31so
StepHypRef Expression
1 nfcvd 2765 . . 3  |-  ( X  e.  B  ->  F/_ x
( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
2 oveq1 6657 . . . . . . . . 9  |-  ( x  =  X  ->  (
x  ./\  W )  =  ( X  ./\  W ) )
32oveq2d 6666 . . . . . . . 8  |-  ( x  =  X  ->  (
s  .\/  ( x  ./\ 
W ) )  =  ( s  .\/  ( X  ./\  W ) ) )
4 id 22 . . . . . . . 8  |-  ( x  =  X  ->  x  =  X )
53, 4eqeq12d 2637 . . . . . . 7  |-  ( x  =  X  ->  (
( s  .\/  (
x  ./\  W )
)  =  x  <->  ( s  .\/  ( X  ./\  W
) )  =  X ) )
65anbi2d 740 . . . . . 6  |-  ( x  =  X  ->  (
( -.  s  .<_  W  /\  ( s  .\/  ( x  ./\  W ) )  =  x )  <-> 
( -.  s  .<_  W  /\  ( s  .\/  ( X  ./\  W ) )  =  X ) ) )
72oveq2d 6666 . . . . . . 7  |-  ( x  =  X  ->  ( N  .\/  ( x  ./\  W ) )  =  ( N  .\/  ( X 
./\  W ) ) )
87eqeq2d 2632 . . . . . 6  |-  ( x  =  X  ->  (
z  =  ( N 
.\/  ( x  ./\  W ) )  <->  z  =  ( N  .\/  ( X 
./\  W ) ) ) )
96, 8imbi12d 334 . . . . 5  |-  ( x  =  X  ->  (
( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) )  <->  ( ( -.  s  .<_  W  /\  ( s  .\/  ( X  ./\  W ) )  =  X )  -> 
z  =  ( N 
.\/  ( X  ./\  W ) ) ) ) )
109ralbidv 2986 . . . 4  |-  ( x  =  X  ->  ( A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) )  <->  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
1110riotabidv 6613 . . 3  |-  ( x  =  X  ->  ( iota_ z  e.  B  A. s  e.  A  (
( -.  s  .<_  W  /\  ( s  .\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) ) )  =  (
iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
121, 11csbiegf 3557 . 2  |-  ( X  e.  B  ->  [_ X  /  x ]_ ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s  .\/  (
x  ./\  W )
)  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) ) )  =  (
iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
13 cdleme31so.o . . 3  |-  O  =  ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) ) )
1413csbeq2i 3993 . 2  |-  [_ X  /  x ]_ O  = 
[_ X  /  x ]_ ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) ) )
15 cdleme31so.c . 2  |-  C  =  ( iota_ z  e.  B  A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) )
1612, 14, 153eqtr4g 2681 1  |-  ( X  e.  B  ->  [_ X  /  x ]_ O  =  C )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   A.wral 2912   [_csb 3533   class class class wbr 4653   iota_crio 6610  (class class class)co 6650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-riota 6611  df-ov 6653
This theorem is referenced by:  cdleme31fv1s  35680  cdlemefrs32fva  35688  cdleme32fva  35725
  Copyright terms: Public domain W3C validator