P. 379 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 37801-37900   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	cdlemg17a 37801	TODO: FIX COMMENT. (Contributed by NM, 8-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄))) → (𝐺‘𝑃) ≤ (𝑃 ∨ 𝑄))
Theorem	cdlemg17b 37802*	Part of proof of Lemma G in [Crawley] p. 117, 4th line. Whenever (in their terminology) p ∨ q/0 (i.e. the sublattice from 0 to p ∨ q) contains precisely three atoms and g is not the identity, g(p) = q. See also comments under cdleme0nex 37430. (Contributed by NM, 8-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑃) = 𝑄)
Theorem	cdlemg17dN 37803*	TODO: fix comment. (Contributed by NM, 9-May-2013.) (New usage is discouraged.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑃 ≠ 𝑄) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ∧ (𝐺‘𝑃) ≠ 𝑃)) → (𝑅‘𝐺) = ((𝑃 ∨ 𝑄) ∧ 𝑊))
Theorem	cdlemg17dALTN 37804	Same as cdlemg17dN 37803 with fewer antecedents but longer proof TODO: fix comment. (Contributed by NM, 9-May-2013.) (New usage is discouraged.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ (𝐺‘𝑃) ≠ 𝑃)) → (𝑅‘𝐺) = ((𝑃 ∨ 𝑄) ∧ 𝑊))
Theorem	cdlemg17e 37805*	TODO: fix comment. (Contributed by NM, 8-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ (𝑅‘𝐺)))
Theorem	cdlemg17f 37806*	TODO: fix comment. (Contributed by NM, 8-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ (𝐺‘(𝐹‘𝑃))))
Theorem	cdlemg17g 37807*	TODO: fix comment. (Contributed by NM, 9-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘(𝐹‘𝑃)) ≤ ((𝐹‘𝑃) ∨ (𝐹‘𝑄)))
Theorem	cdlemg17h 37808*	TODO: fix comment. (Contributed by NM, 10-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑆 ≤ ((𝐹‘𝑃) ∨ (𝐹‘𝑄)))) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑆 = (𝐹‘𝑃) ∨ 𝑆 = (𝐹‘𝑄)))
Theorem	cdlemg17i 37809*	TODO: fix comment. (Contributed by NM, 10-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘(𝐹‘𝑃)) = (𝐹‘𝑄))
Theorem	cdlemg17ir 37810*	TODO: fix comment. (Contributed by NM, 13-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐹‘(𝐺‘𝑃)) = (𝐹‘𝑄))
Theorem	cdlemg17j 37811*	TODO: fix comment. (Contributed by NM, 11-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘(𝐹‘𝑃)) = (𝐹‘(𝐺‘𝑃)))
Theorem	cdlemg17pq 37812*	Utility theorem for swapping 𝑃 and 𝑄. TODO: fix comment. (Contributed by NM, 11-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑄 ≠ 𝑃) ∧ ((𝐺‘𝑄) ≠ 𝑄 ∧ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑃) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑄 ∨ 𝑟) = (𝑃 ∨ 𝑟)))))
Theorem	cdlemg17bq 37813*	cdlemg17b 37802 with 𝑃 and 𝑄 swapped. Antecedent 𝐹 ∈ (𝑇‘𝑊) is redundant for easier use. TODO: should we have redundant antecedent for cdlemg17b 37802 also? (Contributed by NM, 13-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘𝑄) = 𝑃)
Theorem	cdlemg17iqN 37814*	cdlemg17i 37809 with 𝑃 and 𝑄 swapped. (Contributed by NM, 13-May-2013.) (New usage is discouraged.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝑃 ≠ 𝑄) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)) ∧ (𝐺‘𝑃) ≠ 𝑃)) → (𝐺‘(𝐹‘𝑄)) = (𝐹‘𝑃))
Theorem	cdlemg17irq 37815*	cdlemg17ir 37810 with 𝑃 and 𝑄 swapped. (Contributed by NM, 13-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐹‘(𝐺‘𝑄)) = (𝐹‘𝑃))
Theorem	cdlemg17jq 37816*	cdlemg17j 37811 with 𝑃 and 𝑄 swapped. (Contributed by NM, 13-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘(𝐹‘𝑄)) = (𝐹‘(𝐺‘𝑄)))
Theorem	cdlemg17 37817*	Part of Lemma G of [Crawley] p. 117, lines 7 and 8. We show an argument whose value at 𝐺 equals itself. TODO: fix comment. (Contributed by NM, 12-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝐺‘((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ (𝑄 ∨ (𝐹‘(𝐺‘𝑄))))) = ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ (𝑄 ∨ (𝐹‘(𝐺‘𝑄)))))
Theorem	cdlemg18a 37818	Show two lines are different. TODO: fix comment. (Contributed by NM, 14-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ ((𝐹‘𝑄) ∨ (𝐹‘𝑃)) ≠ (𝑃 ∨ 𝑄))) → (𝑃 ∨ (𝐹‘𝑄)) ≠ (𝑄 ∨ (𝐹‘𝑃)))
Theorem	cdlemg18b 37819	Lemma for cdlemg18c 37820. TODO: fix comment. (Contributed by NM, 15-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ (𝐹‘𝑃) ≠ 𝑄 ∧ ((𝐹‘𝑄) ∨ (𝐹‘𝑃)) ≠ (𝑃 ∨ 𝑄))) → ¬ 𝑃 ≤ (𝑈 ∨ (𝐹‘𝑄)))
Theorem	cdlemg18c 37820	Show two lines intersect at an atom. TODO: fix comment. (Contributed by NM, 15-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ (𝐹‘𝑃) ≠ 𝑄 ∧ ((𝐹‘𝑄) ∨ (𝐹‘𝑃)) ≠ (𝑃 ∨ 𝑄))) → ((𝑃 ∨ (𝐹‘𝑄)) ∧ (𝑄 ∨ (𝐹‘𝑃))) ∈ 𝐴)
Theorem	cdlemg18d 37821*	Show two lines intersect at an atom. TODO: fix comment. (Contributed by NM, 15-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄 ∧ (𝐺‘𝑃) ≠ 𝑃) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ (𝑄 ∨ (𝐹‘(𝐺‘𝑄)))) ∈ 𝐴)
Theorem	cdlemg18 37822*	Show two lines intersect at an atom. TODO: fix comment. (Contributed by NM, 15-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄 ∧ (𝐺‘𝑃) ≠ 𝑃) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ (𝑄 ∨ (𝐹‘(𝐺‘𝑄)))) ≤ 𝑊)
Theorem	cdlemg19a 37823*	Show two lines intersect at an atom. TODO: fix comment. (Contributed by NM, 15-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄 ∧ (𝐺‘𝑃) ≠ 𝑃) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ (𝑄 ∨ (𝐹‘(𝐺‘𝑄)))) = ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊))
Theorem	cdlemg19 37824*	Show two lines intersect at an atom. TODO: fix comment. (Contributed by NM, 15-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄 ∧ (𝐺‘𝑃) ≠ 𝑃) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg20 37825*	Show two lines intersect at an atom. TODO: fix comment. (Contributed by NM, 23-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg21 37826*	Version of cdlemg19 with (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) instead of (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑄) as a condition. (Contributed by NM, 23-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄 ∧ (𝐹‘𝑃) ≠ 𝑃) ∧ ((𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg22 37827*	cdlemg21 37826 with (𝐹‘𝑃) ≠ 𝑃 condition removed. (Contributed by NM, 23-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ ((𝑅‘𝐹) ≤ (𝑃 ∨ 𝑄) ∧ ((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg24 37828*	Combine cdlemg16z 37799 and cdlemg22 37827. TODO: Fix comment. (Contributed by NM, 24-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (((𝐹‘(𝐺‘𝑃)) ∨ (𝐹‘(𝐺‘𝑄))) ≠ (𝑃 ∨ 𝑄) ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg37 37829*	Use cdlemg8 37771 to eliminate the ≠ (𝑃 ∨ 𝑄) condition of cdlemg24 37828. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄 ∧ ¬ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg25zz 37830	cdlemg16zz 37800 restated for easier studying. TODO: Discard this after everything is figured out. (Contributed by NM, 26-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ ¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑧) ∧ ¬ (𝑅‘𝐺) ≤ (𝑃 ∨ 𝑧))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑧 ∨ (𝐹‘(𝐺‘𝑧))) ∧ 𝑊))
Theorem	cdlemg26zz 37831	cdlemg16zz 37800 restated for easier studying. TODO: Discard this after everything is figured out. (Contributed by NM, 26-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝐺 ∈ 𝑇 ∧ ¬ (𝑅‘𝐹) ≤ (𝑄 ∨ 𝑧) ∧ ¬ (𝑅‘𝐺) ≤ (𝑄 ∨ 𝑧))) → ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊) = ((𝑧 ∨ (𝐹‘(𝐺‘𝑧))) ∧ 𝑊))
Theorem	cdlemg27a 37832	For use with case when (𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)) or (𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)) is zero, letting us establish ¬ 𝑧 ≤ 𝑊 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣) via 4atex 37216. TODO: Fix comment. (Contributed by NM, 28-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝑧 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑧 ≤ (𝑃 ∨ 𝑣) ∧ (𝐹‘𝑃) ≠ 𝑃)) → ¬ (𝑅‘𝐹) ≤ (𝑃 ∨ 𝑧))
Theorem	cdlemg28a 37833	Part of proof of Lemma G of [Crawley] p. 116. First equality of the equation of line 14 on p. 117. (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ ((𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺)) ∧ 𝑧 ≤ (𝑃 ∨ 𝑣) ∧ ((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑧 ∨ (𝐹‘(𝐺‘𝑧))) ∧ 𝑊))
Theorem	cdlemg31b0N 37834	TODO: Fix comment. (Contributed by NM, 30-May-2013.) (New usage is discouraged.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ 𝐹 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ (𝐹‘𝑃) ≠ 𝑃)) → (𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)))
Theorem	cdlemg31b0a 37835	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹))) → (𝑁 ∈ 𝐴 ∨ 𝑁 = (0.‘𝐾)))
Theorem	cdlemg27b 37836	TODO: Fix comment. (Contributed by NM, 28-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝑧 ≠ 𝑁)) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑧 ≤ (𝑃 ∨ 𝑣) ∧ (𝐹‘𝑃) ≠ 𝑃)) → ¬ (𝑅‘𝐹) ≤ (𝑄 ∨ 𝑧))
Theorem	cdlemg31a 37837	TODO: fix comment. (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑣 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇)) → 𝑁 ≤ (𝑃 ∨ 𝑣))
Theorem	cdlemg31b 37838	TODO: fix comment. (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) ∧ (𝑣 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇)) → 𝑁 ≤ (𝑄 ∨ (𝑅‘𝐹)))
Theorem	cdlemg31c 37839	Show that when 𝑁 is an atom, it is not under 𝑊. TODO: Is there a shorter direct proof? TODO: should we eliminate (𝐹‘𝑃) ≠ 𝑃 here? (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ (𝐹‘𝑃) ≠ 𝑃 ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)
Theorem	cdlemg31d 37840	Eliminate (𝐹‘𝑃) ≠ 𝑃 from cdlemg31c 37839. TODO: Prove directly. TODO: do we need to eliminate (𝐹‘𝑃) ≠ 𝑃? It might be better to do this all at once at the end. See also cdlemg29 37845 versus cdlemg28 37844. (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ 𝑁 ∈ 𝐴)) → ¬ 𝑁 ≤ 𝑊)
Theorem	cdlemg33b0 37841*	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝑁 ∈ 𝐴 ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg33c0 37842*	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)))
Theorem	cdlemg28b 37843*	Part of proof of Lemma G of [Crawley] p. 116. Second equality of the equation of line 14 on p. 117. Note that ¬ 𝑧 ≤ 𝑊 is redundant here (but simplifies cdlemg28 37844.) (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ ((𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺)) ∧ ((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃))) → ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊) = ((𝑧 ∨ (𝐹‘(𝐺‘𝑧))) ∧ 𝑊))
Theorem	cdlemg28 37844*	Part of proof of Lemma G of [Crawley] p. 116. Chain the equalities of line 14 on p. 117. TODO: rearrange hypotheses in the order of cdlemg29 37845 (and maybe leading up to this too)? (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ ((𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺)) ∧ ((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg29 37845*	Eliminate (𝐹‘𝑃) ≠ 𝑃 and (𝐺‘𝑃) ≠ 𝑃 from cdlemg28 37844. TODO: would it be better to do this later? (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑧 ∈ 𝐴 ∧ ¬ 𝑧 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ ((𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂) ∧ 𝑧 ≤ (𝑃 ∨ 𝑣) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg33a 37846*	TODO: Fix comment. (Contributed by NM, 29-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ 𝑂 ∈ 𝐴) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ ((𝑃 ≠ 𝑄 ∧ 𝑁 ≠ 𝑂) ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg33b 37847*	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ 𝑂 ∈ 𝐴) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg33c 37848*	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑁 ∈ 𝐴 ∧ 𝑂 = (0.‘𝐾)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg33d 37849*	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑁 = (0.‘𝐾) ∧ 𝑂 ∈ 𝐴) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐺) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg33e 37850*	TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝑁 = (0.‘𝐾) ∧ 𝑂 = (0.‘𝐾)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg33 37851*	Combine cdlemg33b 37847, cdlemg33c 37848, cdlemg33d 37849, cdlemg33e 37850. TODO: Fix comment. (Contributed by NM, 30-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑁 ∧ 𝑧 ≠ 𝑂 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
Theorem	cdlemg34 37852*	Use cdlemg33 to eliminate 𝑧 from cdlemg29 37845. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))    &   ⊢ 𝑂 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐺)))    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝑃 ≠ 𝑄) ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg35 37853*	TODO: Fix comment. TODO: should we have a more general version of hlsupr 36526 to avoid the ≠ conditions? (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ∃𝑣 ∈ 𝐴 (𝑣 ≤ 𝑊 ∧ (𝑣 ≠ (𝑅‘𝐹) ∧ 𝑣 ≠ (𝑅‘𝐺))))
Theorem	cdlemg36 37854*	Use cdlemg35 to eliminate 𝑣 from cdlemg34 37852. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg38 37855	Use cdlemg37 37829 to eliminate ∃𝑟 ∈ 𝐴 from cdlemg36 37854. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄) ∧ (((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg39 37856	Eliminate ≠ conditions from cdlemg38 37855. TODO: Would this better be done at cdlemg35 37853? TODO: Fix comment. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ 𝑃 ≠ 𝑄)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg40 37857	Eliminate 𝑃 ≠ 𝑄 conditions from cdlemg39 37856. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑃 ∨ (𝐹‘(𝐺‘𝑃))) ∧ 𝑊) = ((𝑄 ∨ (𝐹‘(𝐺‘𝑄))) ∧ 𝑊))
Theorem	cdlemg41 37858	Convert cdlemg40 37857 to function composition. TODO: Fix comment. (Contributed by NM, 31-May-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑃 ∨ ((𝐹 ∘ 𝐺)‘𝑃)) ∧ 𝑊) = ((𝑄 ∨ ((𝐹 ∘ 𝐺)‘𝑄)) ∧ 𝑊))
Theorem	ltrnco 37859	The composition of two translations is a translation. Part of proof of Lemma G of [Crawley] p. 116, line 15 on p. 117. (Contributed by NM, 31-May-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) ∈ 𝑇)
Theorem	trlcocnv 37860	Swap the arguments of the trace of a composition with converse. (Contributed by NM, 1-Jul-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ ◡𝐺)) = (𝑅‘(𝐺 ∘ ◡𝐹)))
Theorem	trlcoabs 37861	Absorption into a composition by joining with trace. (Contributed by NM, 22-Jul-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (((𝐹 ∘ 𝐺)‘𝑃) ∨ (𝑅‘𝐹)) = ((𝐺‘𝑃) ∨ (𝑅‘𝐹)))
Theorem	trlcoabs2N 37862	Absorption of the trace of a composition. (Contributed by NM, 29-Jul-2013.) (New usage is discouraged.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝐹‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))) = ((𝐹‘𝑃) ∨ (𝐺‘𝑃)))
Theorem	trlcoat 37863	The trace of a composition of two translations is an atom if their traces are different. (Contributed by NM, 15-Jun-2013.)
⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ 𝐺)) ∈ 𝐴)
Theorem	trlcocnvat 37864	Commonly used special case of trlcoat 37863. (Contributed by NM, 1-Jul-2013.)
⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝑅‘(𝐹 ∘ ◡𝐺)) ∈ 𝐴)
Theorem	trlconid 37865	The composition of two different translations is not the identity translation. (Contributed by NM, 22-Jul-2013.)
⊢ 𝐵 = (Base‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∘ 𝐺) ≠ ( I ↾ 𝐵))
Theorem	trlcolem 37866	Lemma for trlco 37867. (Contributed by NM, 1-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ ∧ = (meet‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺)))
Theorem	trlco 37867	The trace of a composition of translations is less than or equal to the join of their traces. Part of proof of Lemma G of [Crawley] p. 116, second paragraph on p. 117. (Contributed by NM, 2-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝑅‘(𝐹 ∘ 𝐺)) ≤ ((𝑅‘𝐹) ∨ (𝑅‘𝐺)))
Theorem	trlcone 37868	If two translations have different traces, the trace of their composition is also different. (Contributed by NM, 14-Jun-2013.)
⊢ 𝐵 = (Base‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑅‘𝐹) ≠ (𝑅‘𝐺) ∧ 𝐺 ≠ ( I ↾ 𝐵))) → (𝑅‘𝐹) ≠ (𝑅‘(𝐹 ∘ 𝐺)))
Theorem	cdlemg42 37869	Part of proof of Lemma G of [Crawley] p. 116, first line of third paragraph on p. 117. (Contributed by NM, 3-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → ¬ (𝐺‘𝑃) ≤ (𝑃 ∨ (𝐹‘𝑃)))
Theorem	cdlemg43 37870	Part of proof of Lemma G of [Crawley] p. 116, third line of third paragraph on p. 117. (Contributed by NM, 3-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ ∧ = (meet‘𝐾)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → (𝐹‘(𝐺‘𝑃)) = (((𝐺‘𝑃) ∨ (𝑅‘𝐹)) ∧ ((𝐹‘𝑃) ∨ (𝑅‘𝐺))))
Theorem	cdlemg44a 37871	Part of proof of Lemma G of [Crawley] p. 116, fourth line of third paragraph on p. 117: "so fg(p) = gf(p)." (Contributed by NM, 3-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ ≤ = (le‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ ((𝐹‘𝑃) ≠ 𝑃 ∧ (𝐺‘𝑃) ≠ 𝑃 ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺))) → (𝐹‘(𝐺‘𝑃)) = (𝐺‘(𝐹‘𝑃)))
Theorem	cdlemg44b 37872	Eliminate (𝐹‘𝑃) ≠ 𝑃, (𝐺‘𝑃) ≠ 𝑃 from cdlemg44a 37871. (Contributed by NM, 3-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ ≤ = (le‘𝐾)    &   ⊢ 𝐴 = (Atoms‘𝐾)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹‘(𝐺‘𝑃)) = (𝐺‘(𝐹‘𝑃)))
Theorem	cdlemg44 37873	Part of proof of Lemma G of [Crawley] p. 116, fifth line of third paragraph on p. 117: "and hence fg = gf." (Contributed by NM, 3-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑅‘𝐹) ≠ (𝑅‘𝐺)) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹))
Theorem	cdlemg47a 37874	TODO: fix comment. TODO: Use this above in place of (𝐹‘𝑃) = 𝑃 antecedents? (Contributed by NM, 5-Jun-2013.)
⊢ 𝐵 = (Base‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ 𝐹 = ( I ↾ 𝐵)) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹))
Theorem	cdlemg46 37875*	Part of proof of Lemma G of [Crawley] p. 116, seventh line of third paragraph on p. 117: "hf and f have different traces." (Contributed by NM, 5-Jun-2013.)
⊢ 𝐵 = (Base‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ ℎ ∈ 𝑇) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ ℎ ≠ ( I ↾ 𝐵) ∧ (𝑅‘ℎ) ≠ (𝑅‘𝐹))) → (𝑅‘(ℎ ∘ 𝐹)) ≠ (𝑅‘𝐹))
Theorem	cdlemg47 37876*	Part of proof of Lemma G of [Crawley] p. 116, ninth line of third paragraph on p. 117: "we conclude that gf = fg." (Contributed by NM, 5-Jun-2013.)
⊢ 𝐵 = (Base‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (ℎ ∈ 𝑇 ∧ (𝑅‘𝐹) = (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ ℎ ≠ ( I ↾ 𝐵) ∧ (𝑅‘ℎ) ≠ (𝑅‘𝐹))) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹))
Theorem	cdlemg48 37877	Eliminate ℎ from cdlemg47 37876. (Contributed by NM, 5-Jun-2013.)
⊢ 𝐵 = (Base‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐹) = (𝑅‘𝐺))) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹))
Theorem	ltrncom 37878	Composition is commutative for translations. Part of proof of Lemma G of [Crawley] p. 116. (Contributed by NM, 5-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → (𝐹 ∘ 𝐺) = (𝐺 ∘ 𝐹))
Theorem	ltrnco4 37879	Rearrange a composition of 4 translations, analogous to an4 654. (Contributed by NM, 10-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐸 ∈ 𝑇 ∧ 𝐹 ∈ 𝑇) → ((𝐷 ∘ 𝐸) ∘ (𝐹 ∘ 𝐺)) = ((𝐷 ∘ 𝐹) ∘ (𝐸 ∘ 𝐺)))
Theorem	trljco 37880	Trace joined with trace of composition. (Contributed by NM, 15-Jun-2013.)
⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ((𝑅‘𝐹) ∨ (𝑅‘(𝐹 ∘ 𝐺))) = ((𝑅‘𝐹) ∨ (𝑅‘𝐺)))
Theorem	trljco2 37881	Trace joined with trace of composition. (Contributed by NM, 16-Jun-2013.)
⊢ ∨ = (join‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    ⇒   ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) → ((𝑅‘𝐹) ∨ (𝑅‘(𝐹 ∘ 𝐺))) = ((𝑅‘𝐺) ∨ (𝑅‘(𝐹 ∘ 𝐺))))
Syntax	ctgrp 37882	Extend class notation with translation group.
class TGrp
Definition	df-tgrp 37883*	Define the class of all translation groups. 𝑘 is normally a member of HL. Each base set is the set of all lattice translations with respect to a hyperplane 𝑤, and the operation is function composition. Similar to definition of G in [Crawley] p. 116, third paragraph (which defines this for geomodular lattices). (Contributed by NM, 5-Jun-2013.)
⊢ TGrp = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((LTrn‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓 ∘ 𝑔))⟩}))
Theorem	tgrpfset 37884*	The translation group maps for a lattice 𝐾. (Contributed by NM, 5-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    ⇒   ⊢ (𝐾 ∈ 𝑉 → (TGrp‘𝐾) = (𝑤 ∈ 𝐻 ↦ {⟨(Base‘ndx), ((LTrn‘𝐾)‘𝑤)⟩, ⟨(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓 ∘ 𝑔))⟩}))
Theorem	tgrpset 37885*	The translation group for a fiducial co-atom 𝑊. (Contributed by NM, 5-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    ⇒   ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐺 = {⟨(Base‘ndx), 𝑇⟩, ⟨(+g‘ndx), (𝑓 ∈ 𝑇, 𝑔 ∈ 𝑇 ↦ (𝑓 ∘ 𝑔))⟩})
Theorem	tgrpbase 37886	The base set of the translation group is the set of all translations (for a fiducial co-atom 𝑊). (Contributed by NM, 5-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    &   ⊢ 𝐶 = (Base‘𝐺)    ⇒   ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐶 = 𝑇)
Theorem	tgrpopr 37887*	The group operation of the translation group is function composition. (Contributed by NM, 5-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    &   ⊢ + = (+g‘𝐺)    ⇒   ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → + = (𝑓 ∈ 𝑇, 𝑔 ∈ 𝑇 ↦ (𝑓 ∘ 𝑔)))
Theorem	tgrpov 37888	The group operation value of the translation group is the composition of translations. (Contributed by NM, 5-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    &   ⊢ + = (+g‘𝐺)    ⇒   ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻 ∧ (𝑋 ∈ 𝑇 ∧ 𝑌 ∈ 𝑇)) → (𝑋 + 𝑌) = (𝑋 ∘ 𝑌))
Theorem	tgrpgrplem 37889	Lemma for tgrpgrp 37890. (Contributed by NM, 6-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    &   ⊢ + = (+g‘𝐺)    &   ⊢ 𝐵 = (Base‘𝐾)    ⇒   ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐺 ∈ Grp)
Theorem	tgrpgrp 37890	The translation group is a group. (Contributed by NM, 6-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    ⇒   ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐺 ∈ Grp)
Theorem	tgrpabl 37891	The translation group is an Abelian group. Lemma G of [Crawley] p. 116. (Contributed by NM, 6-Jun-2013.)
⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝐺 = ((TGrp‘𝐾)‘𝑊)    ⇒   ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐺 ∈ Abel)
Syntax	ctendo 37892	Extend class notation with translation group endomorphisms.
class TEndo
Syntax	cedring 37893	Extend class notation with division ring on trace-preserving endomorphisms.
class EDRing
Syntax	cedring-rN 37894	Extend class notation with division ring on trace-preserving endomorphisms, with multiplication reversed. TODO: remove EDRingR theorems if not used.
class EDRingR
Definition	df-tendo 37895*	Define trace-preserving endomorphisms on the set of translations. (Contributed by NM, 8-Jun-2013.)
⊢ TEndo = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {𝑓 ∣ (𝑓:((LTrn‘𝑘)‘𝑤)⟶((LTrn‘𝑘)‘𝑤) ∧ ∀𝑥 ∈ ((LTrn‘𝑘)‘𝑤)∀𝑦 ∈ ((LTrn‘𝑘)‘𝑤)(𝑓‘(𝑥 ∘ 𝑦)) = ((𝑓‘𝑥) ∘ (𝑓‘𝑦)) ∧ ∀𝑥 ∈ ((LTrn‘𝑘)‘𝑤)(((trL‘𝑘)‘𝑤)‘(𝑓‘𝑥))(le‘𝑘)(((trL‘𝑘)‘𝑤)‘𝑥))}))
Definition	df-edring-rN 37896*	Define division ring on trace-preserving endomorphisms. Definition of E of [Crawley] p. 117, 4th line from bottom. (Contributed by NM, 8-Jun-2013.)
⊢ EDRingR = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑡 ∘ 𝑠))⟩}))
Definition	df-edring 37897*	Define division ring on trace-preserving endomorphisms. The multiplication operation is reversed composition, per the definition of E of [Crawley] p. 117, 4th line from bottom. (Contributed by NM, 8-Jun-2013.)
⊢ EDRing = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ {⟨(Base‘ndx), ((TEndo‘𝑘)‘𝑤)⟩, ⟨(+g‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))⟩, ⟨(.r‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑡 ∈ ((TEndo‘𝑘)‘𝑤) ↦ (𝑠 ∘ 𝑡))⟩}))
Theorem	tendofset 37898*	The set of all trace-preserving endomorphisms on the set of translations for a lattice 𝐾. (Contributed by NM, 8-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    ⇒   ⊢ (𝐾 ∈ 𝑉 → (TEndo‘𝐾) = (𝑤 ∈ 𝐻 ↦ {𝑠 ∣ (𝑠:((LTrn‘𝐾)‘𝑤)⟶((LTrn‘𝐾)‘𝑤) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)∀𝑔 ∈ ((LTrn‘𝐾)‘𝑤)(𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ ((LTrn‘𝐾)‘𝑤)(((trL‘𝐾)‘𝑤)‘(𝑠‘𝑓)) ≤ (((trL‘𝐾)‘𝑤)‘𝑓))}))
Theorem	tendoset 37899*	The set of trace-preserving endomorphisms on the set of translations for a fiducial co-atom 𝑊. (Contributed by NM, 8-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)    ⇒   ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐸 = {𝑠 ∣ (𝑠:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑠‘(𝑓 ∘ 𝑔)) = ((𝑠‘𝑓) ∘ (𝑠‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑠‘𝑓)) ≤ (𝑅‘𝑓))})
Theorem	istendo 37900*	The predicate "is a trace-preserving endomorphism". Similar to definition of trace-preserving endomorphism in [Crawley] p. 117, penultimate line. (Contributed by NM, 8-Jun-2013.)
⊢ ≤ = (le‘𝐾)    &   ⊢ 𝐻 = (LHyp‘𝐾)    &   ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)    &   ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)    &   ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)    ⇒   ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑆 ∈ 𝐸 ↔ (𝑆:𝑇⟶𝑇 ∧ ∀𝑓 ∈ 𝑇 ∀𝑔 ∈ 𝑇 (𝑆‘(𝑓 ∘ 𝑔)) = ((𝑆‘𝑓) ∘ (𝑆‘𝑔)) ∧ ∀𝑓 ∈ 𝑇 (𝑅‘(𝑆‘𝑓)) ≤ (𝑅‘𝑓))))