Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ltrnnidn Structured version   Visualization version   GIF version
Theorem ltrnnidn 39558
Description: If a lattice translation is not the identity, then the translation of any atom not under the fiducial co-atom π‘Š is different from the atom. Remark above Lemma C in [Crawley] p. 112. (Contributed by NM, 24-May-2012.)
Hypotheses
Ref Expression
ltrnnidn.b 𝐡 = (Baseβ€˜πΎ)
ltrnnidn.l ≀ = (leβ€˜πΎ)
ltrnnidn.a 𝐴 = (Atomsβ€˜πΎ)
ltrnnidn.h 𝐻 = (LHypβ€˜πΎ)
ltrnnidn.t 𝑇 = ((LTrnβ€˜πΎ)β€˜π‘Š)
Assertion
Ref Expression
ltrnnidn (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (πΉβ€˜π‘ƒ) β‰  𝑃)
Proof of Theorem ltrnnidn
StepHypRef Expression
1 simp1l 1194 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ 𝐾 ∈ HL)
2 hlatl 38743 . . . 4 (𝐾 ∈ HL β†’ 𝐾 ∈ AtLat)
31, 2syl 17 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ 𝐾 ∈ AtLat)
4 simp1 1133 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (𝐾 ∈ HL ∧ π‘Š ∈ 𝐻))
5 simp2l 1196 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ 𝐹 ∈ 𝑇)
6 simp2r 1197 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ 𝐹 β‰  ( I β†Ύ 𝐡))
7 ltrnnidn.b . . . . 5 𝐡 = (Baseβ€˜πΎ)
8 ltrnnidn.a . . . . 5 𝐴 = (Atomsβ€˜πΎ)
9 ltrnnidn.h . . . . 5 𝐻 = (LHypβ€˜πΎ)
10 ltrnnidn.t . . . . 5 𝑇 = ((LTrnβ€˜πΎ)β€˜π‘Š)
11 eqid 2726 . . . . 5 ((trLβ€˜πΎ)β€˜π‘Š) = ((trLβ€˜πΎ)β€˜π‘Š)
127, 8, 9, 10, 11trlnidat 39557 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) ∈ 𝐴)
134, 5, 6, 12syl3anc 1368 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) ∈ 𝐴)
14 eqid 2726 . . . 4 (0.β€˜πΎ) = (0.β€˜πΎ)
1514, 8atn0 38691 . . 3 ((𝐾 ∈ AtLat ∧ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) ∈ 𝐴) β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) β‰  (0.β€˜πΎ))
163, 13, 15syl2anc 583 . 2 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) β‰  (0.β€˜πΎ))
17 simpl1 1188 . . . . 5 ((((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) ∧ (πΉβ€˜π‘ƒ) = 𝑃) β†’ (𝐾 ∈ HL ∧ π‘Š ∈ 𝐻))
18 simpl3 1190 . . . . 5 ((((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) ∧ (πΉβ€˜π‘ƒ) = 𝑃) β†’ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š))
19 simpl2l 1223 . . . . 5 ((((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) ∧ (πΉβ€˜π‘ƒ) = 𝑃) β†’ 𝐹 ∈ 𝑇)
20 simpr 484 . . . . 5 ((((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) ∧ (πΉβ€˜π‘ƒ) = 𝑃) β†’ (πΉβ€˜π‘ƒ) = 𝑃)
21 ltrnnidn.l . . . . . 6 ≀ = (leβ€˜πΎ)
2221, 14, 8, 9, 10, 11trl0 39554 . . . . 5 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) = (0.β€˜πΎ))
2317, 18, 19, 20, 22syl112anc 1371 . . . 4 ((((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) ∧ (πΉβ€˜π‘ƒ) = 𝑃) β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) = (0.β€˜πΎ))
2423ex 412 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ ((πΉβ€˜π‘ƒ) = 𝑃 β†’ (((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) = (0.β€˜πΎ)))
2524necon3d 2955 . 2 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ ((((trLβ€˜πΎ)β€˜π‘Š)β€˜πΉ) β‰  (0.β€˜πΎ) β†’ (πΉβ€˜π‘ƒ) β‰  𝑃))
2616, 25mpd 15 1 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 β‰  ( I β†Ύ 𝐡)) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (πΉβ€˜π‘ƒ) β‰  𝑃)
Colors of variables: wff setvar class
Syntax hints:  Β¬ wn 3   β†’ wi 4   ∧ wa 395   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098   β‰  wne 2934   class class class wbr 5141   I cid 5566   β†Ύ cres 5671  β€˜cfv 6537  Basecbs 17153  lecple 17213  0.cp0 18388  Atomscatm 38646  AtLatcal 38647  HLchlt 38733  LHypclh 39368  LTrncltrn 39485  trLctrl 39542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-rep 5278  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7722
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rmo 3370  df-reu 3371  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-iun 4992  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8824  df-proset 18260  df-poset 18278  df-plt 18295  df-lub 18311  df-glb 18312  df-join 18313  df-meet 18314  df-p0 18390  df-p1 18391  df-lat 18397  df-clat 18464  df-oposet 38559  df-ol 38561  df-oml 38562  df-covers 38649  df-ats 38650  df-atl 38681  df-cvlat 38705  df-hlat 38734  df-lhyp 39372  df-laut 39373  df-ldil 39488  df-ltrn 39489  df-trl 39543
This theorem is referenced by:  ltrnideq  39559
  Copyright terms: Public domain W3C validator