Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdleme41sn4aw Structured version   Visualization version   Unicode version
Theorem cdleme41sn4aw 35763
Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(r) is for on and off P .\/ Q line. TODO: FIX COMMENT. (Contributed by NM, 19-Mar-2013.)
Hypotheses
Ref Expression
cdleme41.b |- B = ( Base ` K )
cdleme41.l |- .<_ = ( le ` K )
cdleme41.j |- .\/ = ( join ` K )
cdleme41.m |- ./\ = ( meet ` K )
cdleme41.a |- A = ( Atoms ` K )
cdleme41.h |- H = ( LHyp ` K )
cdleme41.u |- U = ( ( P .\/ Q ) ./\ W )
cdleme41.d |- D = ( ( s .\/ U ) ./\ ( Q .\/ ( ( P .\/ s ) ./\ W ) ) )
cdleme41.e |- E = ( ( t .\/ U ) ./\ ( Q .\/ ( ( P .\/ t ) ./\ W ) ) )
cdleme41.g |- G = ( ( P .\/ Q ) ./\ ( E .\/ ( ( s .\/ t ) ./\ W ) ) )
cdleme41.i |- I = ( iota_ y e. B A. t e. A ( ( -. t .<_ W /\ -. t .<_ ( P .\/ Q ) ) -> y = G ) )
cdleme41.n |- N = if ( s .<_ ( P .\/ Q ) , I , D )
Assertion
Ref Expression
cdleme41sn4aw |- ( ( ( ( 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   .\/ , s   .<_ , s   ./\ , s   P, s   Q, s   R, s   S, s   U, s   W, s   y, t, A, s   B, s, t, y   y, D   y, G   E, s, y   H, s, t, y   t, .\/ , y   K, s, t, y   t, .<_ , y   t, ./\ , y   t, P, y   t, Q, y   t, R, y   t, S, y   t, U, y   t, W, y
Allowed substitution hints:   D( t, s)   E( t)   G( t, s)   I( y, t, s)   N( y, t, s)
Proof of Theorem cdleme41sn4aw
StepHypRef Expression
1 simp1 1061 . . 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 ) ) -> ( ( K e. HL /\ W e. H ) /\ ( P e. A /\ -. P .<_ W ) /\ ( Q e. A /\ -. Q .<_ W ) ) )
2 simp21 1094 . . 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 ) ) -> P =/= Q )
3 simp23 1096 . . 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 /\ -. S .<_ W ) )
4 simp22 1095 . . 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 /\ -. R .<_ W ) )
5 simp32 1098 . . 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 ) )
6 simp31 1097 . . 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 ) )
7 simp33 1099 . . . 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 ) ) -> R =/= S )
87necomd 2849 . . 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 =/= R )
9 cdleme41.b . . . 4 |- B = ( Base ` K )
10 cdleme41.l . . . 4 |- .<_ = ( le ` K )
11 cdleme41.j . . . 4 |- .\/ = ( join ` K )
12 cdleme41.m . . . 4 |- ./\ = ( meet ` K )
13 cdleme41.a . . . 4 |- A = ( Atoms ` K )
14 cdleme41.h . . . 4 |- H = ( LHyp ` K )
15 cdleme41.u . . . 4 |- U = ( ( P .\/ Q ) ./\ W )
16 cdleme41.d . . . 4 |- D = ( ( s .\/ U ) ./\ ( Q .\/ ( ( P .\/ s ) ./\ W ) ) )
17 cdleme41.e . . . 4 |- E = ( ( t .\/ U ) ./\ ( Q .\/ ( ( P .\/ t ) ./\ W ) ) )
18 cdleme41.g . . . 4 |- G = ( ( P .\/ Q ) ./\ ( E .\/ ( ( s .\/ t ) ./\ W ) ) )
19 cdleme41.i . . . 4 |- I = ( iota_ y e. B A. t e. A ( ( -. t .<_ W /\ -. t .<_ ( P .\/ Q ) ) -> y = G ) )
20 cdleme41.n . . . 4 |- N = if ( s .<_ ( P .\/ Q ) , I , D )
219, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20cdleme41sn3aw 35762 . . 3 |- ( ( ( ( K e. HL /\ W e. H ) /\ ( P e. A /\ -. P .<_ W ) /\ ( Q e. A /\ -. Q .<_ W ) ) /\ ( P =/= Q /\ ( S e. A /\ -. S .<_ W ) /\ ( R e. A /\ -. R .<_ W ) ) /\ ( S .<_ ( P .\/ Q ) /\ -. R .<_ ( P .\/ Q ) /\ S =/= R ) ) -> [_ S / s ]_ N =/= [_ R / s ]_ N )
221, 2, 3, 4, 5, 6, 8, 21syl133anc 1349 . 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 =/= [_ R / s ]_ N )
2322necomd 2849 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 setvar class
Syntax hints:   -. wn 3   -> wi 4   /\ wa 384   /\ w3a 1037   = wceq 1483   e. wcel 1990   =/= wne 2794   A.wral 2912   [_csb 3533   ifcif 4086   class class class wbr 4653   ` cfv 5888   iota_crio 6610  (class class class)co 6650   Basecbs 15857   lecple 15948   joincjn 16944   meetcmee 16945   Atomscatm 34550   HLchlt 34637   LHypclh 35270
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-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-riotaBAD 34239
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  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-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-iin 4523  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-undef 7399  df-preset 16928  df-poset 16946  df-plt 16958  df-lub 16974  df-glb 16975  df-join 16976  df-meet 16977  df-p0 17039  df-p1 17040  df-lat 17046  df-clat 17108  df-oposet 34463  df-ol 34465  df-oml 34466  df-covers 34553  df-ats 34554  df-atl 34585  df-cvlat 34609  df-hlat 34638  df-llines 34784  df-lplanes 34785  df-lvols 34786  df-lines 34787  df-psubsp 34789  df-pmap 34790  df-padd 35082  df-lhyp 35274
This theorem is referenced by:  cdleme41snaw  35764
  Copyright terms: Public domain W3C validator