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

Theorem ltrnatneq 31053
Description: If any atom (under  W) is not equal to its translation, so is any other atom. TODO:  -.  P  .<_  W isn't needed to prove this. Will removing it shorten (and not lengthen) proofs using it? (Contributed by NM, 6-May-2013.)
Hypotheses
Ref Expression
ltrn2eq.l  |-  .<_  =  ( le `  K )
ltrn2eq.a  |-  A  =  ( Atoms `  K )
ltrn2eq.h  |-  H  =  ( LHyp `  K
)
ltrn2eq.t  |-  T  =  ( ( LTrn `  K
) `  W )
Assertion
Ref Expression
ltrnatneq  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( F `
 P )  =/= 
P )  ->  ( F `  Q )  =/=  Q )

Proof of Theorem ltrnatneq
StepHypRef Expression
1 ltrn2eq.l . . . 4  |-  .<_  =  ( le `  K )
2 ltrn2eq.a . . . 4  |-  A  =  ( Atoms `  K )
3 ltrn2eq.h . . . 4  |-  H  =  ( LHyp `  K
)
4 ltrn2eq.t . . . 4  |-  T  =  ( ( LTrn `  K
) `  W )
51, 2, 3, 4ltrn2ateq 31051 . . 3  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) )  ->  (
( F `  P
)  =  P  <->  ( F `  Q )  =  Q ) )
65necon3bid 2638 . 2  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) ) )  ->  (
( F `  P
)  =/=  P  <->  ( F `  Q )  =/=  Q
) )
76biimp3a 1284 1  |-  ( ( ( K  e.  HL  /\  W  e.  H )  /\  ( F  e.  T  /\  ( P  e.  A  /\  -.  P  .<_  W )  /\  ( Q  e.  A  /\  -.  Q  .<_  W ) )  /\  ( F `
 P )  =/= 
P )  ->  ( F `  Q )  =/=  Q )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 360    /\ w3a 937    = wceq 1653    e. wcel 1726    =/= wne 2601   class class class wbr 4215   ` cfv 5457   lecple 13541   Atomscatm 30135   HLchlt 30222   LHypclh 30855   LTrncltrn 30972
This theorem is referenced by:  ltrnatlw  31054  cdlemg13  31523  cdlemg17i  31540  cdlemg17pq  31543  cdlemg19  31555  cdlemg21  31557
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-rep 4323  ax-sep 4333  ax-nul 4341  ax-pow 4380  ax-pr 4406  ax-un 4704
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-nel 2604  df-ral 2712  df-rex 2713  df-reu 2714  df-rab 2716  df-v 2960  df-sbc 3164  df-csb 3254  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-pw 3803  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-iun 4097  df-br 4216  df-opab 4270  df-mpt 4271  df-id 4501  df-xp 4887  df-rel 4888  df-cnv 4889  df-co 4890  df-dm 4891  df-rn 4892  df-res 4893  df-ima 4894  df-iota 5421  df-fun 5459  df-fn 5460  df-f 5461  df-f1 5462  df-fo 5463  df-f1o 5464  df-fv 5465  df-ov 6087  df-oprab 6088  df-mpt2 6089  df-1st 6352  df-2nd 6353  df-undef 6546  df-riota 6552  df-map 7023  df-poset 14408  df-plt 14420  df-lub 14436  df-glb 14437  df-join 14438  df-meet 14439  df-p0 14473  df-p1 14474  df-lat 14480  df-clat 14542  df-oposet 30048  df-ol 30050  df-oml 30051  df-covers 30138  df-ats 30139  df-atl 30170  df-cvlat 30194  df-hlat 30223  df-lhyp 30859  df-laut 30860  df-ldil 30975  df-ltrn 30976  df-trl 31030
  Copyright terms: Public domain W3C validator