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

Theorem cdleml2N 37100
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 994 . 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 1027 . . 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 1029 . . 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 36890 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E  /\  f  e.  T
)  ->  ( U `  f )  e.  T
)
81, 2, 3, 7syl3anc 1226 . 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 1028 . . 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 36890 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  V  e.  E  /\  f  e.  T
)  ->  ( V `  f )  e.  T
)
111, 9, 3, 10syl3anc 1226 . 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 37099 . 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 37097 . 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 1231 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 setvar class
Syntax hints:    -> wi 4    /\ wa 367    /\ w3a 971    = wceq 1398    e. wcel 1823    =/= wne 2649   E.wrex 2805    _I cid 4779    |` cres 4990   ` cfv 5570   Basecbs 14716   HLchlt 35472   LHypclh 36105   LTrncltrn 36222   trLctrl 36280   TEndoctendo 36875
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565  ax-riotaBAD 35081
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-fal 1404  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-nel 2652  df-ral 2809  df-rex 2810  df-reu 2811  df-rmo 2812  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-op 4023  df-uni 4236  df-iun 4317  df-iin 4318  df-br 4440  df-opab 4498  df-mpt 4499  df-id 4784  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-riota 6232  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-1st 6773  df-2nd 6774  df-undef 6994  df-map 7414  df-preset 15756  df-poset 15774  df-plt 15787  df-lub 15803  df-glb 15804  df-join 15805  df-meet 15806  df-p0 15868  df-p1 15869  df-lat 15875  df-clat 15937  df-oposet 35298  df-ol 35300  df-oml 35301  df-covers 35388  df-ats 35389  df-atl 35420  df-cvlat 35444  df-hlat 35473  df-llines 35619  df-lplanes 35620  df-lvols 35621  df-lines 35622  df-psubsp 35624  df-pmap 35625  df-padd 35917  df-lhyp 36109  df-laut 36110  df-ldil 36225  df-ltrn 36226  df-trl 36281  df-tendo 36878
This theorem is referenced by:  cdleml3N  37101
  Copyright terms: Public domain W3C validator