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

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

Proof of Theorem cdleme31fv1s
StepHypRef Expression
1 cdleme31.o . . 3  |-  O  =  ( iota_ z  e.  B A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( x  ./\  W ) )  =  x )  ->  z  =  ( N  .\/  ( x 
./\  W ) ) ) )
2 cdleme31.f . . 3  |-  F  =  ( x  e.  B  |->  if ( ( P  =/=  Q  /\  -.  x  .<_  W ) ,  O ,  x ) )
3 eqid 2316 . . 3  |-  ( 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 ) ) ) )
41, 2, 3cdleme31fv1 30398 . 2  |-  ( ( X  e.  B  /\  ( P  =/=  Q  /\  -.  X  .<_  W ) )  ->  ( F `  X )  =  (
iota_ z  e.  B A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
51, 3cdleme31so 30386 . . 3  |-  ( X  e.  B  ->  [_ X  /  x ]_ O  =  ( iota_ z  e.  B A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
65adantr 451 . 2  |-  ( ( X  e.  B  /\  ( P  =/=  Q  /\  -.  X  .<_  W ) )  ->  [_ X  /  x ]_ O  =  (
iota_ z  e.  B A. s  e.  A  ( ( -.  s  .<_  W  /\  ( s 
.\/  ( X  ./\  W ) )  =  X )  ->  z  =  ( N  .\/  ( X 
./\  W ) ) ) ) )
74, 6eqtr4d 2351 1  |-  ( ( X  e.  B  /\  ( P  =/=  Q  /\  -.  X  .<_  W ) )  ->  ( F `  X )  =  [_ X  /  x ]_ O
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    = wceq 1633    e. wcel 1701    =/= wne 2479   A.wral 2577   [_csb 3115   ifcif 3599   class class class wbr 4060    e. cmpt 4114   ` cfv 5292  (class class class)co 5900   iota_crio 6339
This theorem is referenced by:  cdlemefrs32fva1  30408  cdleme32fva1  30445
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1537  ax-5 1548  ax-17 1607  ax-9 1645  ax-8 1666  ax-14 1705  ax-6 1720  ax-7 1725  ax-11 1732  ax-12 1897  ax-ext 2297  ax-sep 4178  ax-nul 4186  ax-pr 4251
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1533  df-nf 1536  df-sb 1640  df-eu 2180  df-mo 2181  df-clab 2303  df-cleq 2309  df-clel 2312  df-nfc 2441  df-ne 2481  df-ral 2582  df-rex 2583  df-reu 2584  df-rab 2586  df-v 2824  df-sbc 3026  df-csb 3116  df-dif 3189  df-un 3191  df-in 3193  df-ss 3200  df-nul 3490  df-if 3600  df-sn 3680  df-pr 3681  df-op 3683  df-uni 3865  df-br 4061  df-opab 4115  df-mpt 4116  df-id 4346  df-xp 4732  df-rel 4733  df-cnv 4734  df-co 4735  df-dm 4736  df-iota 5256  df-fun 5294  df-fv 5300  df-ov 5903  df-riota 6346
  Copyright terms: Public domain W3C validator