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

Theorem cdlemftr1 30023
Description: Part of proof of Lemma G of [Crawley] p. 116, sixth line of third paragraph on p. 117: there is "a translation h, different from the identity, such that tr h  =/= tr f." (Contributed by NM, 25-Jul-2013.)
Hypotheses
Ref Expression
cdlemftr.b  |-  B  =  ( Base `  K
)
cdlemftr.h  |-  H  =  ( LHyp `  K
)
cdlemftr.t  |-  T  =  ( ( LTrn `  K
) `  W )
cdlemftr.r  |-  R  =  ( ( trL `  K
) `  W )
Assertion
Ref Expression
cdlemftr1  |-  ( ( K  e.  HL  /\  W  e.  H )  ->  E. f  e.  T  ( f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X ) )
Distinct variable groups:    f, X    f, H    f, K    R, f    T, f    f, W
Allowed substitution hint:    B( f)

Proof of Theorem cdlemftr1
StepHypRef Expression
1 cdlemftr.b . . 3  |-  B  =  ( Base `  K
)
2 cdlemftr.h . . 3  |-  H  =  ( LHyp `  K
)
3 cdlemftr.t . . 3  |-  T  =  ( ( LTrn `  K
) `  W )
4 cdlemftr.r . . 3  |-  R  =  ( ( trL `  K
) `  W )
51, 2, 3, 4cdlemftr2 30022 . 2  |-  ( ( K  e.  HL  /\  W  e.  H )  ->  E. f  e.  T  ( f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X  /\  ( R `  f )  =/=  X ) )
6 3simpa 954 . . 3  |-  ( ( f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X  /\  ( R `
 f )  =/= 
X )  ->  (
f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X ) )
76reximi 2651 . 2  |-  ( E. f  e.  T  ( f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X  /\  ( R `
 f )  =/= 
X )  ->  E. f  e.  T  ( f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X
) )
85, 7syl 17 1  |-  ( ( K  e.  HL  /\  W  e.  H )  ->  E. f  e.  T  ( f  =/=  (  _I  |`  B )  /\  ( R `  f )  =/=  X ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    /\ wa 360    /\ w3a 936    = wceq 1624    e. wcel 1685    =/= wne 2447   E.wrex 2545    _I cid 4303    |` cres 4690   ` cfv 5221   Basecbs 13142   HLchlt 28807   LHypclh 29440   LTrncltrn 29557   trLctrl 29614
This theorem is referenced by:  cdlemftr0  30024  cdlemg48  30193  cdlemk19x  30399
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-13 1687  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1867  ax-ext 2265  ax-rep 4132  ax-sep 4142  ax-nul 4150  ax-pow 4187  ax-pr 4213  ax-un 4511
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 937  df-3an 938  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-nel 2450  df-ral 2549  df-rex 2550  df-reu 2551  df-rmo 2552  df-rab 2553  df-v 2791  df-sbc 2993  df-csb 3083  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-pw 3628  df-sn 3647  df-pr 3648  df-op 3650  df-uni 3829  df-iun 3908  df-iin 3909  df-br 4025  df-opab 4079  df-mpt 4080  df-id 4308  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-fun 5223  df-fn 5224  df-f 5225  df-f1 5226  df-fo 5227  df-f1o 5228  df-fv 5229  df-ov 5822  df-oprab 5823  df-mpt2 5824  df-1st 6083  df-2nd 6084  df-iota 6252  df-undef 6291  df-riota 6299  df-map 6769  df-poset 14074  df-plt 14086  df-lub 14102  df-glb 14103  df-join 14104  df-meet 14105  df-p0 14139  df-p1 14140  df-lat 14146  df-clat 14208  df-oposet 28633  df-ol 28635  df-oml 28636  df-covers 28723  df-ats 28724  df-atl 28755  df-cvlat 28779  df-hlat 28808  df-llines 28954  df-lplanes 28955  df-lvols 28956  df-lines 28957  df-psubsp 28959  df-pmap 28960  df-padd 29252  df-lhyp 29444  df-laut 29445  df-ldil 29560  df-ltrn 29561  df-trl 29615
  Copyright terms: Public domain W3C validator