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

Theorem cdleme35sn2aw 30647
Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(x) is one-to-one outside of  P  .\/  Q line case; compare cdleme32sn2awN 30623. TODO: FIX COMMENT (Contributed by NM, 18-Mar-2013.)
Hypotheses
Ref Expression
cdleme32s.b  |-  B  =  ( Base `  K
)
cdleme32s.l  |-  .<_  =  ( le `  K )
cdleme32s.j  |-  .\/  =  ( join `  K )
cdleme32s.m  |-  ./\  =  ( meet `  K )
cdleme32s.a  |-  A  =  ( Atoms `  K )
cdleme32s.h  |-  H  =  ( LHyp `  K
)
cdleme32s.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdleme32s.d  |-  D  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
cdleme32s.n  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  D
)
Assertion
Ref Expression
cdleme35sn2aw  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  [_ R  /  s ]_ N  =/=  [_ S  /  s ]_ N )
Distinct variable groups:    A, s    B, s    H, s    .\/ , s    K, s    .<_ , s    ./\ , s    P, s    Q, s    R, s    S, s    U, s    W, s
Allowed substitution hints:    D( s)    I(
s)    N( s)

Proof of Theorem cdleme35sn2aw
StepHypRef Expression
1 cdleme32s.l . . 3  |-  .<_  =  ( le `  K )
2 cdleme32s.j . . 3  |-  .\/  =  ( join `  K )
3 cdleme32s.m . . 3  |-  ./\  =  ( meet `  K )
4 cdleme32s.a . . 3  |-  A  =  ( Atoms `  K )
5 cdleme32s.h . . 3  |-  H  =  ( LHyp `  K
)
6 cdleme32s.u . . 3  |-  U  =  ( ( P  .\/  Q )  ./\  W )
7 eqid 2283 . . 3  |-  ( ( R  .\/  U ) 
./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )  =  ( ( R  .\/  U
)  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )
8 eqid 2283 . . 3  |-  ( ( S  .\/  U ) 
./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )  =  ( ( S  .\/  U
)  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
91, 2, 3, 4, 5, 6, 7, 8cdleme35h2 30646 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  (
( R  .\/  U
)  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )  =/=  (
( S  .\/  U
)  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) ) )
10 simp22l 1074 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  R  e.  A )
11 simp31 991 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  -.  R  .<_  ( P  .\/  Q ) )
12 cdleme32s.d . . . 4  |-  D  =  ( ( s  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  s )  ./\  W
) ) )
13 cdleme32s.n . . . 4  |-  N  =  if ( s  .<_  ( P  .\/  Q ) ,  I ,  D
)
1412, 13, 7cdleme31sn2 30578 . . 3  |-  ( ( R  e.  A  /\  -.  R  .<_  ( P 
.\/  Q ) )  ->  [_ R  /  s ]_ N  =  (
( R  .\/  U
)  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) ) )
1510, 11, 14syl2anc 642 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  [_ R  /  s ]_ N  =  ( ( R 
.\/  U )  ./\  ( Q  .\/  ( ( P  .\/  R ) 
./\  W ) ) ) )
16 simp23l 1076 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  S  e.  A )
17 simp32 992 . . 3  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  -.  S  .<_  ( P  .\/  Q ) )
1812, 13, 8cdleme31sn2 30578 . . 3  |-  ( ( S  e.  A  /\  -.  S  .<_  ( P 
.\/  Q ) )  ->  [_ S  /  s ]_ N  =  (
( S  .\/  U
)  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) ) )
1916, 17, 18syl2anc 642 . 2  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  [_ S  /  s ]_ N  =  ( ( S 
.\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S ) 
./\  W ) ) ) )
209, 15, 193netr4d 2473 1  |-  ( ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) )  /\  ( -.  R  .<_  ( P  .\/  Q )  /\  -.  S  .<_  ( P  .\/  Q )  /\  R  =/=  S
) )  ->  [_ R  /  s ]_ N  =/=  [_ S  /  s ]_ N )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684    =/= wne 2446   [_csb 3081   ifcif 3565   class class class wbr 4023   ` cfv 5255  (class class class)co 5858   Basecbs 13148   lecple 13215   joincjn 14078   meetcmee 14079   Atomscatm 29453   HLchlt 29540   LHypclh 30173
This theorem is referenced by:  cdleme41snaw  30665
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-nel 2449  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-iin 3908  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5861  df-oprab 5862  df-mpt2 5863  df-1st 6122  df-2nd 6123  df-undef 6298  df-riota 6304  df-poset 14080  df-plt 14092  df-lub 14108  df-glb 14109  df-join 14110  df-meet 14111  df-p0 14145  df-p1 14146  df-lat 14152  df-clat 14214  df-oposet 29366  df-ol 29368  df-oml 29369  df-covers 29456  df-ats 29457  df-atl 29488  df-cvlat 29512  df-hlat 29541  df-lines 29690  df-psubsp 29692  df-pmap 29693  df-padd 29985  df-lhyp 30177
  Copyright terms: Public domain W3C validator