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

Theorem cdleml2N 31788
Description: Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 1-Aug-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdleml1.b  |-  B  =  ( Base `  K
)
cdleml1.h  |-  H  =  ( LHyp `  K
)
cdleml1.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdleml1.r  |-  R  =  ( ( trL `  K
) `  W )
cdleml1.e  |-  E  =  ( ( TEndo `  K
) `  W )
Assertion
Ref Expression
cdleml2N  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  E. s  e.  E  ( s `  ( U `  f
) )  =  ( V `  f ) )
Distinct variable groups:    E, s    K, s    R, s    T, s    U, s    V, s    W, s    f, s
Allowed substitution hints:    B( f, s)    R( f)    T( f)    U( f)    E( f)    H( f, s)    K( f)    V( f)    W( f)

Proof of Theorem cdleml2N
StepHypRef Expression
1 simp1 955 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  ( K  e.  HL  /\  W  e.  H ) )
2 simp21 988 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  U  e.  E )
3 simp23 990 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  f  e.  T )
4 cdleml1.h . . . 4  |-  H  =  ( LHyp `  K
)
5 cdleml1.t . . . 4  |-  T  =  ( ( LTrn `  K
) `  W )
6 cdleml1.e . . . 4  |-  E  =  ( ( TEndo `  K
) `  W )
74, 5, 6tendocl 31578 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E  /\  f  e.  T
)  ->  ( U `  f )  e.  T
)
81, 2, 3, 7syl3anc 1182 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  ( U `  f )  e.  T
)
9 simp22 989 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  V  e.  E )
104, 5, 6tendocl 31578 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  V  e.  E  /\  f  e.  T
)  ->  ( V `  f )  e.  T
)
111, 9, 3, 10syl3anc 1182 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  ( V `  f )  e.  T
)
12 cdleml1.b . . 3  |-  B  =  ( Base `  K
)
13 cdleml1.r . . 3  |-  R  =  ( ( trL `  K
) `  W )
1412, 4, 5, 13, 6cdleml1N 31787 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  ( R `  ( U `  f
) )  =  ( R `  ( V `
 f ) ) )
154, 5, 13, 6cdlemk 31785 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( ( U `
 f )  e.  T  /\  ( V `
 f )  e.  T )  /\  ( R `  ( U `  f ) )  =  ( R `  ( V `  f )
) )  ->  E. s  e.  E  ( s `  ( U `  f
) )  =  ( V `  f ) )
161, 8, 11, 14, 15syl121anc 1187 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( U  e.  E  /\  V  e.  E  /\  f  e.  T )  /\  (
f  =/=  (  _I  |`  B )  /\  ( U `  f )  =/=  (  _I  |`  B )  /\  ( V `  f )  =/=  (  _I  |`  B ) ) )  ->  E. s  e.  E  ( s `  ( U `  f
) )  =  ( V `  f ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1632    e. wcel 1696    =/= wne 2459   E.wrex 2557    _I cid 4320    |` cres 4707   ` cfv 5271   Basecbs 13164   HLchlt 30162   LHypclh 30795   LTrncltrn 30912   trLctrl 30969   TEndoctendo 31563
This theorem is referenced by:  cdleml3N  31789
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-nel 2462  df-ral 2561  df-rex 2562  df-reu 2563  df-rmo 2564  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-iin 3924  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-undef 6314  df-riota 6320  df-map 6790  df-poset 14096  df-plt 14108  df-lub 14124  df-glb 14125  df-join 14126  df-meet 14127  df-p0 14161  df-p1 14162  df-lat 14168  df-clat 14230  df-oposet 29988  df-ol 29990  df-oml 29991  df-covers 30078  df-ats 30079  df-atl 30110  df-cvlat 30134  df-hlat 30163  df-llines 30309  df-lplanes 30310  df-lvols 30311  df-lines 30312  df-psubsp 30314  df-pmap 30315  df-padd 30607  df-lhyp 30799  df-laut 30800  df-ldil 30915  df-ltrn 30916  df-trl 30970  df-tendo 31566
  Copyright terms: Public domain W3C validator