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

Theorem cdleme35h2 34069
Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(x) is one-to-one outside of  P  .\/  Q line. TODO: FIX COMMENT. (Contributed by NM, 18-Mar-2013.)
Hypotheses
Ref Expression
cdleme35.l  |-  .<_  =  ( le `  K )
cdleme35.j  |-  .\/  =  ( join `  K )
cdleme35.m  |-  ./\  =  ( meet `  K )
cdleme35.a  |-  A  =  ( Atoms `  K )
cdleme35.h  |-  H  =  ( LHyp `  K
)
cdleme35.u  |-  U  =  ( ( P  .\/  Q )  ./\  W )
cdleme35.f  |-  F  =  ( ( R  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )
cdleme35.g  |-  G  =  ( ( S  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
Assertion
Ref Expression
cdleme35h2  |-  ( ( ( ( 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
) )  ->  F  =/=  G )

Proof of Theorem cdleme35h2
StepHypRef Expression
1 simp33 1052 . 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 )
2 simpl1 1017 . . . . 5  |-  ( ( ( ( ( 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
) )  /\  F  =  G )  ->  (
( K  e.  HL  /\  W  e.  H )  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) )
3 simpl2 1018 . . . . 5  |-  ( ( ( ( ( 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
) )  /\  F  =  G )  ->  ( P  =/=  Q  /\  ( R  e.  A  /\  -.  R  .<_  W )  /\  ( S  e.  A  /\  -.  S  .<_  W ) ) )
4 simpl31 1095 . . . . 5  |-  ( ( ( ( ( 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
) )  /\  F  =  G )  ->  -.  R  .<_  ( P  .\/  Q ) )
5 simpl32 1096 . . . . 5  |-  ( ( ( ( ( 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
) )  /\  F  =  G )  ->  -.  S  .<_  ( P  .\/  Q ) )
6 simpr 467 . . . . 5  |-  ( ( ( ( ( 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
) )  /\  F  =  G )  ->  F  =  G )
7 cdleme35.l . . . . . 6  |-  .<_  =  ( le `  K )
8 cdleme35.j . . . . . 6  |-  .\/  =  ( join `  K )
9 cdleme35.m . . . . . 6  |-  ./\  =  ( meet `  K )
10 cdleme35.a . . . . . 6  |-  A  =  ( Atoms `  K )
11 cdleme35.h . . . . . 6  |-  H  =  ( LHyp `  K
)
12 cdleme35.u . . . . . 6  |-  U  =  ( ( P  .\/  Q )  ./\  W )
13 cdleme35.f . . . . . 6  |-  F  =  ( ( R  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  R )  ./\  W )
) )
14 cdleme35.g . . . . . 6  |-  G  =  ( ( S  .\/  U )  ./\  ( Q  .\/  ( ( P  .\/  S )  ./\  W )
) )
157, 8, 9, 10, 11, 12, 13, 14cdleme35h 34068 . . . . 5  |-  ( ( ( ( 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 )  /\  F  =  G ) )  ->  R  =  S )
162, 3, 4, 5, 6, 15syl113anc 1288 . . . 4  |-  ( ( ( ( ( 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
) )  /\  F  =  G )  ->  R  =  S )
1716ex 440 . . 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
) )  ->  ( F  =  G  ->  R  =  S ) )
1817necon3d 2657 . 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  ->  F  =/=  G ) )
191, 18mpd 15 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
) )  ->  F  =/=  G )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 375    /\ w3a 991    = wceq 1455    e. wcel 1898    =/= wne 2633   class class class wbr 4416   ` cfv 5601  (class class class)co 6315   lecple 15246   joincjn 16238   meetcmee 16239   Atomscatm 32874   HLchlt 32961   LHypclh 33594
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1680  ax-4 1693  ax-5 1769  ax-6 1816  ax-7 1862  ax-8 1900  ax-9 1907  ax-10 1926  ax-11 1931  ax-12 1944  ax-13 2102  ax-ext 2442  ax-rep 4529  ax-sep 4539  ax-nul 4548  ax-pow 4595  ax-pr 4653  ax-un 6610
This theorem depends on definitions:  df-bi 190  df-or 376  df-an 377  df-3an 993  df-tru 1458  df-ex 1675  df-nf 1679  df-sb 1809  df-eu 2314  df-mo 2315  df-clab 2449  df-cleq 2455  df-clel 2458  df-nfc 2592  df-ne 2635  df-ral 2754  df-rex 2755  df-reu 2756  df-rab 2758  df-v 3059  df-sbc 3280  df-csb 3376  df-dif 3419  df-un 3421  df-in 3423  df-ss 3430  df-nul 3744  df-if 3894  df-pw 3965  df-sn 3981  df-pr 3983  df-op 3987  df-uni 4213  df-iun 4294  df-iin 4295  df-br 4417  df-opab 4476  df-mpt 4477  df-id 4768  df-xp 4859  df-rel 4860  df-cnv 4861  df-co 4862  df-dm 4863  df-rn 4864  df-res 4865  df-ima 4866  df-iota 5565  df-fun 5603  df-fn 5604  df-f 5605  df-f1 5606  df-fo 5607  df-f1o 5608  df-fv 5609  df-riota 6277  df-ov 6318  df-oprab 6319  df-mpt2 6320  df-1st 6820  df-2nd 6821  df-preset 16222  df-poset 16240  df-plt 16253  df-lub 16269  df-glb 16270  df-join 16271  df-meet 16272  df-p0 16334  df-p1 16335  df-lat 16341  df-clat 16403  df-oposet 32787  df-ol 32789  df-oml 32790  df-covers 32877  df-ats 32878  df-atl 32909  df-cvlat 32933  df-hlat 32962  df-lines 33111  df-psubsp 33113  df-pmap 33114  df-padd 33406  df-lhyp 33598
This theorem is referenced by:  cdleme35sn2aw  34070
  Copyright terms: Public domain W3C validator