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

Theorem cdleml2N 29855
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 960 . 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 993 . . 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 995 . . 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 29645 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  U  e.  E  /\  f  e.  T
)  ->  ( U `  f )  e.  T
)
81, 2, 3, 7syl3anc 1187 . 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 994 . . 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 29645 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  V  e.  E  /\  f  e.  T
)  ->  ( V `  f )  e.  T
)
111, 9, 3, 10syl3anc 1187 . 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 29854 . 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 29852 . 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 1192 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 6    /\ wa 360    /\ w3a 939    = wceq 1619    e. wcel 1621    =/= wne 2412   E.wrex 2510    _I cid 4197    |` cres 4582   ` cfv 4592   Basecbs 13022   HLchlt 28229   LHypclh 28862   LTrncltrn 28979   trLctrl 29036   TEndoctendo 29630
This theorem is referenced by:  cdleml3N  29856
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-13 1625  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1926  ax-ext 2234  ax-rep 4028  ax-sep 4038  ax-nul 4046  ax-pow 4082  ax-pr 4108  ax-un 4403
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 940  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1883  df-eu 2118  df-mo 2119  df-clab 2240  df-cleq 2246  df-clel 2249  df-nfc 2374  df-ne 2414  df-nel 2415  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2516  df-v 2729  df-sbc 2922  df-csb 3010  df-dif 3081  df-un 3083  df-in 3085  df-ss 3089  df-nul 3363  df-if 3471  df-pw 3532  df-sn 3550  df-pr 3551  df-op 3553  df-uni 3728  df-iun 3805  df-iin 3806  df-br 3921  df-opab 3975  df-mpt 3976  df-id 4202  df-xp 4594  df-rel 4595  df-cnv 4596  df-co 4597  df-dm 4598  df-rn 4599  df-res 4600  df-ima 4601  df-fun 4602  df-fn 4603  df-f 4604  df-f1 4605  df-fo 4606  df-f1o 4607  df-fv 4608  df-ov 5713  df-oprab 5714  df-mpt2 5715  df-1st 5974  df-2nd 5975  df-iota 6143  df-undef 6182  df-riota 6190  df-map 6660  df-poset 13924  df-plt 13936  df-lub 13952  df-glb 13953  df-join 13954  df-meet 13955  df-p0 13989  df-p1 13990  df-lat 13996  df-clat 14058  df-oposet 28055  df-ol 28057  df-oml 28058  df-covers 28145  df-ats 28146  df-atl 28177  df-cvlat 28201  df-hlat 28230  df-llines 28376  df-lplanes 28377  df-lvols 28378  df-lines 28379  df-psubsp 28381  df-pmap 28382  df-padd 28674  df-lhyp 28866  df-laut 28867  df-ldil 28982  df-ltrn 28983  df-trl 29037  df-tendo 29633
  Copyright terms: Public domain W3C validator