 Home Metamath Proof ExplorerTheorem List (p. 353 of 424) < Previous  Next > Bad symbols? Try the GIF version. Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

 Color key: Metamath Proof Explorer (1-27745) Hilbert Space Explorer (27746-29270) Users' Mathboxes (29271-42316)

Theorem List for Metamath Proof Explorer - 35201-35300   *Has distinct variable group(s)
TypeLabelDescription
Statement

Theoremidlaut 35201 The identity function is a lattice automorphism. (Contributed by NM, 18-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐼 = (LAut‘𝐾)       (𝐾𝐴 → ( I ↾ 𝐵) ∈ 𝐼)

Theoremlautco 35202 The composition of two lattice automorphisms is a lattice automorphism. (Contributed by NM, 19-Apr-2013.)
𝐼 = (LAut‘𝐾)       ((𝐾𝑉𝐹𝐼𝐺𝐼) → (𝐹𝐺) ∈ 𝐼)

TheorempautsetN 35203* The set of projective automorphisms. (Contributed by NM, 26-Jan-2012.) (New usage is discouraged.)
𝑆 = (PSubSp‘𝐾)    &   𝑀 = (PAut‘𝐾)       (𝐾𝐵𝑀 = {𝑓 ∣ (𝑓:𝑆1-1-onto𝑆 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥𝑦 ↔ (𝑓𝑥) ⊆ (𝑓𝑦)))})

TheoremispautN 35204* The predictate "is a projective automorphism." (Contributed by NM, 26-Jan-2012.) (New usage is discouraged.)
𝑆 = (PSubSp‘𝐾)    &   𝑀 = (PAut‘𝐾)       (𝐾𝐵 → (𝐹𝑀 ↔ (𝐹:𝑆1-1-onto𝑆 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥𝑦 ↔ (𝐹𝑥) ⊆ (𝐹𝑦)))))

Syntaxcldil 35205 Extend class notation with set of all lattice dilations.
class LDil

Syntaxcltrn 35206 Extend class notation with set of all lattice translations.
class LTrn

SyntaxcdilN 35207 Extend class notation with set of all dilations.
class Dil

SyntaxctrnN 35208 Extend class notation with set of all translations.
class Trn

Definitiondf-ldil 35209* Define set of all lattice dilations. Similar to definition of dilation in [Crawley] p. 111. (Contributed by NM, 11-May-2012.)
LDil = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∈ (LAut‘𝑘) ∣ ∀𝑥 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑤 → (𝑓𝑥) = 𝑥)}))

Definitiondf-ltrn 35210* Define set of all lattice translations. Similar to definition of translation in [Crawley] p. 111. (Contributed by NM, 11-May-2012.)
LTrn = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∈ ((LDil‘𝑘)‘𝑤) ∣ ∀𝑝 ∈ (Atoms‘𝑘)∀𝑞 ∈ (Atoms‘𝑘)((¬ 𝑝(le‘𝑘)𝑤 ∧ ¬ 𝑞(le‘𝑘)𝑤) → ((𝑝(join‘𝑘)(𝑓𝑝))(meet‘𝑘)𝑤) = ((𝑞(join‘𝑘)(𝑓𝑞))(meet‘𝑘)𝑤))}))

Definitiondf-dilN 35211* Define set of all dilations. Definition of dilation in [Crawley] p. 111. (Contributed by NM, 30-Jan-2012.)
Dil = (𝑘 ∈ V ↦ (𝑑 ∈ (Atoms‘𝑘) ↦ {𝑓 ∈ (PAut‘𝑘) ∣ ∀𝑥 ∈ (PSubSp‘𝑘)(𝑥 ⊆ ((WAtoms‘𝑘)‘𝑑) → (𝑓𝑥) = 𝑥)}))

Definitiondf-trnN 35212* Define set of all translations. Definition of translation in [Crawley] p. 111. (Contributed by NM, 4-Feb-2012.)
Trn = (𝑘 ∈ V ↦ (𝑑 ∈ (Atoms‘𝑘) ↦ {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))}))

Theoremldilfset 35213* The mapping from fiducial co-atom 𝑤 to its set of lattice dilations. (Contributed by NM, 11-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐼 = (LAut‘𝐾)       (𝐾𝐶 → (LDil‘𝐾) = (𝑤𝐻 ↦ {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑤 → (𝑓𝑥) = 𝑥)}))

Theoremldilset 35214* The set of lattice dilations for a fiducial co-atom 𝑊. (Contributed by NM, 11-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐼 = (LAut‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       ((𝐾𝐶𝑊𝐻) → 𝐷 = {𝑓𝐼 ∣ ∀𝑥𝐵 (𝑥 𝑊 → (𝑓𝑥) = 𝑥)})

Theoremisldil 35215* The predicate "is a lattice dilation". Similar to definition of dilation in [Crawley] p. 111. (Contributed by NM, 11-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐼 = (LAut‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       ((𝐾𝐶𝑊𝐻) → (𝐹𝐷 ↔ (𝐹𝐼 ∧ ∀𝑥𝐵 (𝑥 𝑊 → (𝐹𝑥) = 𝑥))))

Theoremldillaut 35216 A lattice dilation is an automorphism. (Contributed by NM, 20-May-2012.)
𝐻 = (LHyp‘𝐾)    &   𝐼 = (LAut‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝐷) → 𝐹𝐼)

Theoremldil1o 35217 A lattice dilation is a one-to-one onto function. (Contributed by NM, 19-Apr-2013.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝐷) → 𝐹:𝐵1-1-onto𝐵)

Theoremldilval 35218 Value of a lattice dilation under its co-atom. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝐷 ∧ (𝑋𝐵𝑋 𝑊)) → (𝐹𝑋) = 𝑋)

Theoremidldil 35219 The identity function is a lattice dilation. (Contributed by NM, 18-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       ((𝐾𝐴𝑊𝐻) → ( I ↾ 𝐵) ∈ 𝐷)

Theoremldilcnv 35220 The converse of a lattice dilation is a lattice dilation. (Contributed by NM, 10-May-2013.)
𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝐷) → 𝐹𝐷)

Theoremldilco 35221 The composition of two lattice automorphisms is a lattice automorphism. (Contributed by NM, 19-Apr-2013.)
𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝐷𝐺𝐷) → (𝐹𝐺) ∈ 𝐷)

Theoremltrnfset 35222* The set of all lattice translations for a lattice 𝐾. (Contributed by NM, 11-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)       (𝐾𝐶 → (LTrn‘𝐾) = (𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))}))

Theoremltrnset 35223* The set of lattice translations for a fiducial co-atom 𝑊. (Contributed by NM, 11-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       ((𝐾𝐵𝑊𝐻) → 𝑇 = {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))})

Theoremisltrn 35224* The predicate "is a lattice translation". Similar to definition of translation in [Crawley] p. 111. (Contributed by NM, 11-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       ((𝐾𝐵𝑊𝐻) → (𝐹𝑇 ↔ (𝐹𝐷 ∧ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊)))))

Theoremisltrn2N 35225* The predicate "is a lattice translation". Version of isltrn 35224 that considers only different 𝑝 and 𝑞. TODO: Can this eliminate some separate proofs for the 𝑝 = 𝑞 case? (Contributed by NM, 22-Apr-2013.) (New usage is discouraged.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       ((𝐾𝐵𝑊𝐻) → (𝐹𝑇 ↔ (𝐹𝐷 ∧ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊𝑝𝑞) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊)))))

Theoremltrnu 35226 Uniqueness property of a lattice translation value for atoms not under the fiducial co-atom 𝑊. Similar to definition of translation in [Crawley] p. 111. (Contributed by NM, 20-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       ((((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) → ((𝑃 (𝐹𝑃)) 𝑊) = ((𝑄 (𝐹𝑄)) 𝑊))

Theoremltrnldil 35227 A lattice translation is a lattice dilation. (Contributed by NM, 20-May-2012.)
𝐻 = (LHyp‘𝐾)    &   𝐷 = ((LDil‘𝐾)‘𝑊)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇) → 𝐹𝐷)

Theoremltrnlaut 35228 A lattice translation is a lattice automorphism. (Contributed by NM, 20-May-2012.)
𝐻 = (LHyp‘𝐾)    &   𝐼 = (LAut‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇) → 𝐹𝐼)

Theoremltrn1o 35229 A lattice translation is a one-to-one onto function. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇) → 𝐹:𝐵1-1-onto𝐵)

Theoremltrncl 35230 Closure of a lattice translation. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇𝑋𝐵) → (𝐹𝑋) ∈ 𝐵)

Theoremltrn11 35231 One-to-one property of a lattice translation. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑌𝐵)) → ((𝐹𝑋) = (𝐹𝑌) ↔ 𝑋 = 𝑌))

Theoremltrncnvnid 35232 If a translation is different from the identity, so is its converse. (Contributed by NM, 17-Jun-2013.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝐹 ≠ ( I ↾ 𝐵)) → 𝐹 ≠ ( I ↾ 𝐵))

TheoremltrncoidN 35233 Two translations are equal if the composition of one with the converse of the other is the zero translation. This is an analogue of vector subtraction. (Contributed by NM, 7-Apr-2014.) (New usage is discouraged.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝐺𝑇) → ((𝐹𝐺) = ( I ↾ 𝐵) ↔ 𝐹 = 𝐺))

Theoremltrnle 35234 Less-than or equal property of a lattice translation. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑌𝐵)) → (𝑋 𝑌 ↔ (𝐹𝑋) (𝐹𝑌)))

TheoremltrncnvleN 35235 Less-than or equal property of lattice translation converse. (Contributed by NM, 10-May-2013.) (New usage is discouraged.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑌𝐵)) → (𝑋 𝑌 ↔ (𝐹𝑋) (𝐹𝑌)))

Theoremltrnm 35236 Lattice translation of a meet. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (meet‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑌𝐵)) → (𝐹‘(𝑋 𝑌)) = ((𝐹𝑋) (𝐹𝑌)))

Theoremltrnj 35237 Lattice translation of a meet. TODO: change antecedent to 𝐾 ∈ HL (Contributed by NM, 25-May-2012.)
𝐵 = (Base‘𝐾)    &    = (join‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑌𝐵)) → (𝐹‘(𝑋 𝑌)) = ((𝐹𝑋) (𝐹𝑌)))

Theoremltrncvr 35238 Covering property of a lattice translation. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐶 = ( ⋖ ‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑌𝐵)) → (𝑋𝐶𝑌 ↔ (𝐹𝑋)𝐶(𝐹𝑌)))

Theoremltrnval1 35239 Value of a lattice translation under its co-atom. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑋𝐵𝑋 𝑊)) → (𝐹𝑋) = 𝑋)

Theoremltrnid 35240* A lattice translation is the identity function iff all atoms not under the fiducial co-atom 𝑊 are equal to their values. (Contributed by NM, 24-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (∀𝑝𝐴𝑝 𝑊 → (𝐹𝑝) = 𝑝) ↔ 𝐹 = ( I ↾ 𝐵)))

Theoremltrnnid 35241* If a lattice translation is not the identity, then there is an atom not under the fiducial co-atom 𝑊 and not equal to its translation. (Contributed by NM, 24-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝐹 ≠ ( I ↾ 𝐵)) → ∃𝑝𝐴𝑝 𝑊 ∧ (𝐹𝑝) ≠ 𝑝))

Theoremltrnatb 35242 The lattice translation of an atom is an atom. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝑃𝐵) → (𝑃𝐴 ↔ (𝐹𝑃) ∈ 𝐴))

Theoremltrncnvatb 35243 The converse of the lattice translation of an atom is an atom. (Contributed by NM, 2-Jun-2012.)
𝐵 = (Base‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝑃𝐵) → (𝑃𝐴 ↔ (𝐹𝑃) ∈ 𝐴))

Theoremltrnel 35244 The lattice translation of an atom not under the fiducial co-atom is also an atom not under the fiducial co-atom. Remark below Lemma B in [Crawley] p. 112. (Contributed by NM, 22-May-2012.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐹𝑃) ∈ 𝐴 ∧ ¬ (𝐹𝑃) 𝑊))

Theoremltrnat 35245 The lattice translation of an atom is also an atom. TODO: See if this can shorten some ltrnel 35244 uses. (Contributed by NM, 25-May-2012.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝑃𝐴) → (𝐹𝑃) ∈ 𝐴)

Theoremltrncnvat 35246 The converse of the lattice translation of an atom is an atom. (Contributed by NM, 9-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝑃𝐴) → (𝐹𝑃) ∈ 𝐴)

Theoremltrncnvel 35247 The converse of the lattice translation of an atom not under the fiducial co-atom. (Contributed by NM, 10-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐹𝑃) ∈ 𝐴 ∧ ¬ (𝐹𝑃) 𝑊))

TheoremltrncoelN 35248 Composition of lattice translations of an atom. TODO: See if this can shorten some ltrnel 35244 uses. (Contributed by NM, 1-May-2013.) (New usage is discouraged.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝐺𝑇) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐹‘(𝐺𝑃)) ∈ 𝐴 ∧ ¬ (𝐹‘(𝐺𝑃)) 𝑊))

Theoremltrncoat 35249 Composition of lattice translations of an atom. TODO: See if this can shorten some ltrnel 35244, ltrnat 35245 uses. (Contributed by NM, 1-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝐺𝑇) ∧ 𝑃𝐴) → (𝐹‘(𝐺𝑃)) ∈ 𝐴)

Theoremltrncoval 35250 Two ways to express value of translation composition. (Contributed by NM, 31-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝐺𝑇) ∧ 𝑃𝐴) → ((𝐹𝐺)‘𝑃) = (𝐹‘(𝐺𝑃)))

Theoremltrncnv 35251 The converse of a lattice translation is a lattice translation. (Contributed by NM, 10-May-2013.)
𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → 𝐹𝑇)

Theoremltrn11at 35252 Frequently used one-to-one property of lattice translation atoms. (Contributed by NM, 5-May-2013.)
𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴𝑄𝐴𝑃𝑄)) → (𝐹𝑃) ≠ (𝐹𝑄))

Theoremltrneq2 35253* The equality of two translations is determined by their equality at atoms. (Contributed by NM, 2-Mar-2014.)
𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝐺𝑇) → (∀𝑝𝐴 (𝐹𝑝) = (𝐺𝑝) ↔ 𝐹 = 𝐺))

Theoremltrneq 35254* The equality of two translations is determined by their equality at atoms not under co-atom 𝑊. (Contributed by NM, 20-Jun-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝐺𝑇) → (∀𝑝𝐴𝑝 𝑊 → (𝐹𝑝) = (𝐺𝑝)) ↔ 𝐹 = 𝐺))

Theoremidltrn 35255 The identity function is a lattice translation. Remark below Lemma B in [Crawley] p. 112. (Contributed by NM, 18-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       ((𝐾 ∈ HL ∧ 𝑊𝐻) → ( I ↾ 𝐵) ∈ 𝑇)

Theoremltrnmw 35256 Property of lattice translation value. Remark below Lemma B in [Crawley] p. 112. TODO: Can this be used in more places? (Contributed by NM, 20-May-2012.) (Proof shortened by OpenAI, 25-Mar-2020.)
= (le‘𝐾)    &    = (meet‘𝐾)    &    0 = (0.‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐹𝑃) 𝑊) = 0 )

TheoremltrnmwOLD 35257 Property of lattice translation value. Remark below Lemma B in [Crawley] p. 112. TODO: Can this be used in more places? (Contributed by NM, 20-May-2012.) Obsolete version of ltrnmw 35256 as of 25-Mar-2020. (New usage is discouraged.) (Proof modification is discouraged.)
= (le‘𝐾)    &    = (meet‘𝐾)    &    0 = (0.‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐹𝑃) 𝑊) = 0 )

TheoremdilfsetN 35258* The mapping from fiducial atom to set of dilations. (Contributed by NM, 30-Jan-2012.) (New usage is discouraged.)
𝐴 = (Atoms‘𝐾)    &   𝑆 = (PSubSp‘𝐾)    &   𝑊 = (WAtoms‘𝐾)    &   𝑀 = (PAut‘𝐾)    &   𝐿 = (Dil‘𝐾)       (𝐾𝐵𝐿 = (𝑑𝐴 ↦ {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝑑) → (𝑓𝑥) = 𝑥)}))

TheoremdilsetN 35259* The set of dilations for a fiducial atom 𝐷. (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
𝐴 = (Atoms‘𝐾)    &   𝑆 = (PSubSp‘𝐾)    &   𝑊 = (WAtoms‘𝐾)    &   𝑀 = (PAut‘𝐾)    &   𝐿 = (Dil‘𝐾)       ((𝐾𝐵𝐷𝐴) → (𝐿𝐷) = {𝑓𝑀 ∣ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝑓𝑥) = 𝑥)})

TheoremisdilN 35260* The predicate "is a dilation". (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
𝐴 = (Atoms‘𝐾)    &   𝑆 = (PSubSp‘𝐾)    &   𝑊 = (WAtoms‘𝐾)    &   𝑀 = (PAut‘𝐾)    &   𝐿 = (Dil‘𝐾)       ((𝐾𝐵𝐷𝐴) → (𝐹 ∈ (𝐿𝐷) ↔ (𝐹𝑀 ∧ ∀𝑥𝑆 (𝑥 ⊆ (𝑊𝐷) → (𝐹𝑥) = 𝑥))))

TheoremtrnfsetN 35261* The mapping from fiducial atom to set of translations. (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
𝐴 = (Atoms‘𝐾)    &   𝑆 = (PSubSp‘𝐾)    &    + = (+𝑃𝐾)    &    = (⊥𝑃𝐾)    &   𝑊 = (WAtoms‘𝐾)    &   𝑀 = (PAut‘𝐾)    &   𝐿 = (Dil‘𝐾)    &   𝑇 = (Trn‘𝐾)       (𝐾𝐶𝑇 = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))

TheoremtrnsetN 35262* The set of translations for a fiducial atom 𝐷. (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
𝐴 = (Atoms‘𝐾)    &   𝑆 = (PSubSp‘𝐾)    &    + = (+𝑃𝐾)    &    = (⊥𝑃𝐾)    &   𝑊 = (WAtoms‘𝐾)    &   𝑀 = (PAut‘𝐾)    &   𝐿 = (Dil‘𝐾)    &   𝑇 = (Trn‘𝐾)       ((𝐾𝐵𝐷𝐴) → (𝑇𝐷) = {𝑓 ∈ (𝐿𝐷) ∣ ∀𝑞 ∈ (𝑊𝐷)∀𝑟 ∈ (𝑊𝐷)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝐷})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝐷}))})

TheoremistrnN 35263* The predicate "is a translation". (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
𝐴 = (Atoms‘𝐾)    &   𝑆 = (PSubSp‘𝐾)    &    + = (+𝑃𝐾)    &    = (⊥𝑃𝐾)    &   𝑊 = (WAtoms‘𝐾)    &   𝑀 = (PAut‘𝐾)    &   𝐿 = (Dil‘𝐾)    &   𝑇 = (Trn‘𝐾)       ((𝐾𝐵𝐷𝐴) → (𝐹 ∈ (𝑇𝐷) ↔ (𝐹 ∈ (𝐿𝐷) ∧ ∀𝑞 ∈ (𝑊𝐷)∀𝑟 ∈ (𝑊𝐷)((𝑞 + (𝐹𝑞)) ∩ ( ‘{𝐷})) = ((𝑟 + (𝐹𝑟)) ∩ ( ‘{𝐷})))))

Syntaxctrl 35264 Extend class notation with set of all traces of lattice translations.
class trL

Definitiondf-trl 35265* Define trace of a lattice translation. (Contributed by NM, 20-May-2012.)
trL = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑥 ∈ (Base‘𝑘)∀𝑝 ∈ (Atoms‘𝑘)(¬ 𝑝(le‘𝑘)𝑤𝑥 = ((𝑝(join‘𝑘)(𝑓𝑝))(meet‘𝑘)𝑤))))))

Theoremtrlfset 35266* The set of all traces of lattice translations for a lattice 𝐾. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)       (𝐾𝐶 → (trL‘𝐾) = (𝑤𝐻 ↦ (𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑥𝐵𝑝𝐴𝑝 𝑤𝑥 = ((𝑝 (𝑓𝑝)) 𝑤))))))

Theoremtrlset 35267* The set of traces of lattice translations for a fiducial co-atom 𝑊. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       ((𝐾𝐶𝑊𝐻) → 𝑅 = (𝑓𝑇 ↦ (𝑥𝐵𝑝𝐴𝑝 𝑊𝑥 = ((𝑝 (𝑓𝑝)) 𝑊)))))

Theoremtrlval 35268* The value of the trace of a lattice translation. (Contributed by NM, 20-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾𝑉𝑊𝐻) ∧ 𝐹𝑇) → (𝑅𝐹) = (𝑥𝐵𝑝𝐴𝑝 𝑊𝑥 = ((𝑝 (𝐹𝑝)) 𝑊))))

Theoremtrlval2 35269 The value of the trace of a lattice translation, given any atom 𝑃 not under the fiducial co-atom 𝑊. Note: this requires only the weaker assumption 𝐾 ∈ Lat; we use 𝐾 ∈ HL for convenience. (Contributed by NM, 20-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑅𝐹) = ((𝑃 (𝐹𝑃)) 𝑊))

Theoremtrlcl 35270 Closure of the trace of a lattice translation. (Contributed by NM, 22-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝑅𝐹) ∈ 𝐵)

Theoremtrlcnv 35271 The trace of the converse of a lattice translation. (Contributed by NM, 10-May-2013.)
𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝑅𝐹) = (𝑅𝐹))

Theoremtrljat1 35272 The value of a translation of an atom 𝑃 not under the fiducial co-atom 𝑊, joined with trace. Equation above Lemma C in [Crawley] p. 112. TODO: shorten with atmod3i1 34969? (Contributed by NM, 22-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑃 (𝑅𝐹)) = (𝑃 (𝐹𝑃)))

Theoremtrljat2 35273 The value of a translation of an atom 𝑃 not under the fiducial co-atom 𝑊, joined with trace. Equation above Lemma C in [Crawley] p. 112. (Contributed by NM, 25-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ((𝐹𝑃) (𝑅𝐹)) = (𝑃 (𝐹𝑃)))

Theoremtrljat3 35274 The value of a translation of an atom 𝑃 not under the fiducial co-atom 𝑊, joined with trace. Equation above Lemma C in [Crawley] p. 112. (Contributed by NM, 22-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑃 (𝑅𝐹)) = ((𝐹𝑃) (𝑅𝐹)))

Theoremtrlat 35275 If an atom differs from its translation, the trace is an atom. Equation above Lemma C in [Crawley] p. 112. (Contributed by NM, 23-May-2012.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) ≠ 𝑃)) → (𝑅𝐹) ∈ 𝐴)

Theoremtrl0 35276 If an atom not under the fiducial co-atom 𝑊 equals its lattice translation, the trace of the translation is zero. (Contributed by NM, 24-May-2012.)
= (le‘𝐾)    &    0 = (0.‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑅𝐹) = 0 )

Theoremtrlator0 35277 The trace of a lattice translation is an atom or zero. (Contributed by NM, 5-May-2013.)
0 = (0.‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → ((𝑅𝐹) ∈ 𝐴 ∨ (𝑅𝐹) = 0 ))

Theoremtrlatn0 35278 The trace of a lattice translation is an atom iff it is nonzero. (Contributed by NM, 14-Jun-2013.)
0 = (0.‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → ((𝑅𝐹) ∈ 𝐴 ↔ (𝑅𝐹) ≠ 0 ))

Theoremtrlnidat 35279 The trace of a lattice translation other than the identity is an atom. Remark above Lemma C in [Crawley] p. 112. (Contributed by NM, 23-May-2012.)
𝐵 = (Base‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝐹 ≠ ( I ↾ 𝐵)) → (𝑅𝐹) ∈ 𝐴)

Theoremltrnnidn 35280 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.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝐹 ≠ ( I ↾ 𝐵)) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝐹𝑃) ≠ 𝑃)

Theoremltrnideq 35281 Property of the identity lattice translation. (Contributed by NM, 27-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝐹 = ( I ↾ 𝐵) ↔ (𝐹𝑃) = 𝑃))

Theoremtrlid0 35282 The trace of the identity translation is zero. (Contributed by NM, 11-Jun-2013.)
𝐵 = (Base‘𝐾)    &    0 = (0.‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑅 = ((trL‘𝐾)‘𝑊)       ((𝐾 ∈ HL ∧ 𝑊𝐻) → (𝑅‘( I ↾ 𝐵)) = 0 )

Theoremtrlnidatb 35283 A lattice translation is not the identity iff its trace is an atom. TODO: Can proofs be reorganized so this goes with trlnidat 35279? Why do both this and ltrnideq 35281 need trlnidat 35279? (Contributed by NM, 4-Jun-2013.)
𝐵 = (Base‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝐹 ≠ ( I ↾ 𝐵) ↔ (𝑅𝐹) ∈ 𝐴))

Theoremtrlid0b 35284 A lattice translation is the identity iff its trace is zero. (Contributed by NM, 14-Jun-2013.)
𝐵 = (Base‘𝐾)    &    0 = (0.‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝐹 = ( I ↾ 𝐵) ↔ (𝑅𝐹) = 0 ))

Theoremtrlnid 35285 Different translations with the same trace cannot be the identity. (Contributed by NM, 26-Jul-2013.)
𝐵 = (Base‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇𝐺𝑇) ∧ (𝐹𝐺 ∧ (𝑅𝐹) = (𝑅𝐺))) → 𝐹 ≠ ( I ↾ 𝐵))

Theoremltrn2ateq 35286 Property of the equality of a lattice translation with its value. (Contributed by NM, 27-May-2012.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))) → ((𝐹𝑃) = 𝑃 ↔ (𝐹𝑄) = 𝑄))

Theoremltrnateq 35287 If any atom (under 𝑊) is not equal to its translation, so is any other atom. (Contributed by NM, 6-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐹𝑃) = 𝑃) → (𝐹𝑄) = 𝑄)

Theoremltrnatneq 35288 If any atom (under 𝑊) is not equal to its translation, so is any other atom. TODO: ¬ 𝑃 𝑊 isn't needed to prove this. Will removing it shorten (and not lengthen) proofs using it? (Contributed by NM, 6-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝐹𝑃) ≠ 𝑃) → (𝐹𝑄) ≠ 𝑄)

Theoremltrnatlw 35289 If the value of an atom equals the atom in a non-identity translation, the atom is under the fiducial hyperplane. (Contributed by NM, 15-May-2013.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ 𝑄𝐴) ∧ ((𝐹𝑃) ≠ 𝑃 ∧ (𝐹𝑄) = 𝑄)) → 𝑄 𝑊)

Theoremtrlle 35290 The trace of a lattice translation is less than the fiducial co-atom 𝑊. (Contributed by NM, 25-May-2012.)
= (le‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝑅𝐹) 𝑊)

Theoremtrlne 35291 The trace of a lattice translation is not equal to any atom not under the fiducial co-atom 𝑊. Part of proof of Lemma C in [Crawley] p. 112. (Contributed by NM, 25-May-2012.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → 𝑃 ≠ (𝑅𝐹))

Theoremtrlnle 35292 The atom not under the fiducial co-atom 𝑊 is not less than the trace of a lattice translation. Part of proof of Lemma C in [Crawley] p. 112. (Contributed by NM, 26-May-2012.)
= (le‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → ¬ 𝑃 (𝑅𝐹))

Theoremtrlval3 35293 The value of the trace of a lattice translation in terms of 2 atoms. TODO: Try to shorten proof. (Contributed by NM, 3-May-2013.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊) ∧ (𝑃 (𝐹𝑃)) ≠ (𝑄 (𝐹𝑄)))) → (𝑅𝐹) = ((𝑃 (𝐹𝑃)) (𝑄 (𝐹𝑄))))

Theoremtrlval4 35294 The value of the trace of a lattice translation in terms of 2 atoms. (Contributed by NM, 3-May-2013.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ (𝑃𝑄 ∧ ¬ (𝑅𝐹) (𝑃 𝑄))) → (𝑅𝐹) = ((𝑃 (𝐹𝑃)) (𝑄 (𝐹𝑄))))

Theoremtrlval5 35295 The value of the trace of a lattice translation in terms of itself. (Contributed by NM, 19-Jul-2013.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑅𝐹) = ((𝑃 (𝑅𝐹)) 𝑊))

Theoremarglem1N 35296 Lemma for Desargues' law. Theorem 13.3 of [Crawley] p. 110, 3rd and 4th lines from bottom. In these lemmas, 𝑃, 𝑄, 𝑅, 𝑆, 𝑇, 𝑈, 𝐶, 𝐷, 𝐸, 𝐹, and 𝐺 represent Crawley's a0, a1, a2, b0, b1, b2, c, z0, z1, z2, and p respectively. (Contributed by NM, 28-Jun-2012.) (New usage is discouraged.)
= (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐹 = ((𝑃 𝑄) (𝑆 𝑇))    &   𝐺 = ((𝑃 𝑆) (𝑄 𝑇))       ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑄𝐴) ∧ (𝑆𝐴𝑇𝐴𝑃𝑄) ∧ (𝑃𝑆𝑄𝑇𝑆𝑇)) ∧ 𝐺𝐴) → 𝐹𝐴)

Theoremcdlemc1 35297 Part of proof of Lemma C in [Crawley] p. 112. TODO: shorten with atmod3i1 34969? (Contributed by NM, 29-May-2012.)
𝐵 = (Base‘𝐾)    &    = (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝑋𝐵 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑃 ((𝑃 𝑋) 𝑊)) = (𝑃 𝑋))

Theoremcdlemc2 35298 Part of proof of Lemma C in [Crawley] p. 112. (Contributed by NM, 25-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ ((𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))) → (𝐹𝑄) ((𝐹𝑃) ((𝑃 𝑄) 𝑊)))

Theoremcdlemc3 35299 Part of proof of Lemma C in [Crawley] p. 113. (Contributed by NM, 26-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊))) → ((𝐹𝑃) (𝑄 (𝑅𝐹)) → 𝑄 (𝑃 (𝐹𝑃))))

Theoremcdlemc4 35300 Part of proof of Lemma C in [Crawley] p. 113. (Contributed by NM, 26-May-2012.)
= (le‘𝐾)    &    = (join‘𝐾)    &    = (meet‘𝐾)    &   𝐴 = (Atoms‘𝐾)    &   𝐻 = (LHyp‘𝐾)    &   𝑇 = ((LTrn‘𝐾)‘𝑊)    &   𝑅 = ((trL‘𝐾)‘𝑊)       (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ ¬ 𝑄 (𝑃 (𝐹𝑃))) → (𝑄 (𝑅𝐹)) ≠ ((𝐹𝑃) ((𝑃 𝑄) 𝑊)))

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42316
 Copyright terms: Public domain < Previous  Next >