Home | Metamath
Proof Explorer Theorem List (p. 382 of 450) | < 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-28697) |
Hilbert Space Explorer
(28698-30220) |
Users' Mathboxes
(30221-44913) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | cdlemk43N 38101* | Part of proof of Lemma K of [Crawley] p. 118. TODO: fix comment. (Contributed by NM, 31-Jul-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ ((𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁) ∧ (𝐺 ∈ 𝑇 ∧ 𝐺 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑏 ∈ 𝑇 ∧ (𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐺)))) → ((𝑈‘𝐺)‘𝑃) = ⦋𝐺 / 𝑔⦌𝑌) | ||
Theorem | cdlemk35u 38102* | Substitution version of cdlemk35 38050. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘𝐺) ∈ 𝑇) | ||
Theorem | cdlemk55u1 38103* | Lemma for cdlemk55u 38104. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁) ∧ 𝐺 ∈ 𝑇 ∧ 𝐼 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘(𝐺 ∘ 𝐼)) = ((𝑈‘𝐺) ∘ (𝑈‘𝐼))) | ||
Theorem | cdlemk55u 38104* | Part of proof of Lemma K of [Crawley] p. 118. Line 11, p. 120. 𝐺, 𝐼 stand for g, h. 𝑋 represents tau. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇 ∧ 𝐼 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘(𝐺 ∘ 𝐼)) = ((𝑈‘𝐺) ∘ (𝑈‘𝐼))) | ||
Theorem | cdlemk39u1 38105* | Lemma for cdlemk39u 38106. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐹 ≠ 𝑁 ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝐺)) ≤ (𝑅‘𝐺)) | ||
Theorem | cdlemk39u 38106* | Part of proof of Lemma K of [Crawley] p. 118. Line 31, p. 119. Trace-preserving property of the value of tau, represented by (𝑈‘𝐺). (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘(𝑈‘𝐺)) ≤ (𝑅‘𝐺)) | ||
Theorem | cdlemk19u1 38107* | cdlemk19 38007 with simpler hypotheses. TODO: Clean all this up. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ 𝑁 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑈‘𝐹)‘𝑃) = (𝑁‘𝑃)) | ||
Theorem | cdlemk19u 38108* | Part of Lemma K of [Crawley] p. 118. Line 12, p. 120, "f (exponent) tau = k". We represent f, k, tau with 𝐹, 𝑁, 𝑈. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑈‘𝐹) = 𝑁) | ||
Theorem | cdlemk56 38109* | Part of Lemma K of [Crawley] p. 118. Line 11, p. 120, "tau is in Delta" i.e. 𝑈 is a trace-preserving endormorphism. (Contributed by NM, 31-Jul-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑈 ∈ 𝐸) | ||
Theorem | cdlemk19w 38110* | Use a fixed element to eliminate 𝑃 in cdlemk19u 38108. (Contributed by NM, 1-Aug-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ ⊥ = (oc‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑃 = ( ⊥ ‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) → (𝑈‘𝐹) = 𝑁) | ||
Theorem | cdlemk56w 38111* | Use a fixed element to eliminate 𝑃 in cdlemk56 38109. (Contributed by NM, 1-Aug-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ ⊥ = (oc‘𝐾) & ⊢ 𝐴 = (Atoms‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑃 = ( ⊥ ‘𝑊) & ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹)))) & ⊢ 𝑌 = ((𝑃 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑃) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if(𝐹 = 𝑁, 𝑔, 𝑋)) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) → (𝑈 ∈ 𝐸 ∧ (𝑈‘𝐹) = 𝑁)) | ||
Theorem | cdlemk 38112* | Lemma K of [Crawley] p. 118. Final result, lines 11 and 12 on p. 120: given two translations f and k with the same trace, there exists a trace-preserving endomorphism tau whose value at f is k. We use 𝐹, 𝑁, and 𝑢 to represent f, k, and tau. (Contributed by NM, 1-Aug-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) → ∃𝑢 ∈ 𝐸 (𝑢‘𝐹) = 𝑁) | ||
Theorem | tendoex 38113* | Generalization of Lemma K of [Crawley] p. 118, cdlemk 38112. TODO: can this be used to shorten uses of cdlemk 38112? (Contributed by NM, 15-Oct-2013.) |
⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (𝑅‘𝑁) ≤ (𝑅‘𝐹)) → ∃𝑢 ∈ 𝐸 (𝑢‘𝐹) = 𝑁) | ||
Theorem | cdleml1N 38114 | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 1-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸 ∧ 𝑓 ∈ 𝑇) ∧ (𝑓 ≠ ( I ↾ 𝐵) ∧ (𝑈‘𝑓) ≠ ( I ↾ 𝐵) ∧ (𝑉‘𝑓) ≠ ( I ↾ 𝐵))) → (𝑅‘(𝑈‘𝑓)) = (𝑅‘(𝑉‘𝑓))) | ||
Theorem | cdleml2N 38115* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 1-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸 ∧ 𝑓 ∈ 𝑇) ∧ (𝑓 ≠ ( I ↾ 𝐵) ∧ (𝑈‘𝑓) ≠ ( I ↾ 𝐵) ∧ (𝑉‘𝑓) ≠ ( I ↾ 𝐵))) → ∃𝑠 ∈ 𝐸 (𝑠‘(𝑈‘𝑓)) = (𝑉‘𝑓)) | ||
Theorem | cdleml3N 38116* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 1-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑔 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸 ∧ 𝑓 ∈ 𝑇) ∧ (𝑓 ≠ ( I ↾ 𝐵) ∧ 𝑈 ≠ 0 ∧ 𝑉 ≠ 0 )) → ∃𝑠 ∈ 𝐸 (𝑠 ∘ 𝑈) = 𝑉) | ||
Theorem | cdleml4N 38117* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 1-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑔 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ (𝑈 ≠ 0 ∧ 𝑉 ≠ 0 )) → ∃𝑠 ∈ 𝐸 (𝑠 ∘ 𝑈) = 𝑉) | ||
Theorem | cdleml5N 38118* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 1-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑔 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸) ∧ 𝑈 ≠ 0 ) → ∃𝑠 ∈ 𝐸 (𝑠 ∘ 𝑈) = 𝑉) | ||
Theorem | cdleml6 38119* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 11-Aug-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑄 = ((oc‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ◡(𝑠‘ℎ))))) & ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋)) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ℎ ∈ 𝑇 ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → (𝑈 ∈ 𝐸 ∧ (𝑈‘(𝑠‘ℎ)) = ℎ)) | ||
Theorem | cdleml7 38120* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 11-Aug-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑄 = ((oc‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ◡(𝑠‘ℎ))))) & ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋)) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ℎ ∈ 𝑇 ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → ((𝑈 ∘ 𝑠)‘ℎ) = (( I ↾ 𝑇)‘ℎ)) | ||
Theorem | cdleml8 38121* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 11-Aug-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑄 = ((oc‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ◡(𝑠‘ℎ))))) & ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋)) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → (𝑈 ∘ 𝑠) = ( I ↾ 𝑇)) | ||
Theorem | cdleml9 38122* | Part of proof of Lemma L of [Crawley] p. 120. TODO: fix comment. (Contributed by NM, 11-Aug-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑄 = ((oc‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ◡(𝑠‘ℎ))))) & ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋)) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵)) ∧ (𝑠 ∈ 𝐸 ∧ 𝑠 ≠ 0 )) → 𝑈 ≠ 0 ) | ||
Theorem | dva1dim 38123* | Two expressions for the 1-dimensional subspaces of partial vector space A. Remark in [Crawley] p. 120 line 21, but using a non-identity translation (nonzero vector) 𝐹 whose trace is 𝑃 rather than 𝑃 itself; 𝐹 exists by cdlemf 37701. 𝐸 is the division ring base by erngdv 38131, and 𝑠‘𝐹 is the scalar product by dvavsca 38155. 𝐹 must be a non-identity translation for the expression to be a 1-dimensional subspace, although the theorem doesn't require it. (Contributed by NM, 14-Oct-2013.) |
⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∣ ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹)} = {𝑔 ∈ 𝑇 ∣ (𝑅‘𝑔) ≤ (𝑅‘𝐹)}) | ||
Theorem | dvhb1dimN 38124* | Two expressions for the 1-dimensional subspaces of vector space H, in the isomorphism B case where the 2nd vector component is zero. (Contributed by NM, 23-Feb-2014.) (New usage is discouraged.) |
⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 0 = (ℎ ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → {𝑔 ∈ (𝑇 × 𝐸) ∣ ∃𝑠 ∈ 𝐸 𝑔 = 〈(𝑠‘𝐹), 0 〉} = {𝑔 ∈ (𝑇 × 𝐸) ∣ ((𝑅‘(1st ‘𝑔)) ≤ (𝑅‘𝐹) ∧ (2nd ‘𝑔) = 0 )}) | ||
Theorem | erng1lem 38125 | Value of the endomorphism division ring unit. (Contributed by NM, 12-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Ring) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (1r‘𝐷) = ( I ↾ 𝑇)) | ||
Theorem | erngdvlem1 38126* | Lemma for eringring 38130. (Contributed by NM, 4-Aug-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Grp) | ||
Theorem | erngdvlem2N 38127* | Lemma for eringring 38130. (Contributed by NM, 6-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Abel) | ||
Theorem | erngdvlem3 38128* | Lemma for eringring 38130. (Contributed by NM, 6-Aug-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) & ⊢ + = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑎 ∘ 𝑏)) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Ring) | ||
Theorem | erngdvlem4 38129* | Lemma for erngdv 38131. (Contributed by NM, 11-Aug-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) & ⊢ + = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑎 ∘ 𝑏)) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑄 = ((oc‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ◡(𝑠‘ℎ))))) & ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵))) → 𝐷 ∈ DivRing) | ||
Theorem | eringring 38130 | An endomorphism ring is a ring. TODO: fix comment. (Contributed by NM, 4-Aug-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Ring) | ||
Theorem | erngdv 38131 | An endomorphism ring is a division ring. TODO: fix comment. (Contributed by NM, 11-Aug-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ DivRing) | ||
Theorem | erng0g 38132* | The division ring zero of an endomorphism ring. (Contributed by NM, 5-Nov-2013.) (Revised by Mario Carneiro, 23-Jun-2014.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 0 = (0g‘𝐷) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 0 = 𝑂) | ||
Theorem | erng1r 38133 | The division ring unit of an endomorphism ring. (Contributed by NM, 5-Nov-2013.) (Revised by Mario Carneiro, 23-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 1 = (1r‘𝐷) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 1 = ( I ↾ 𝑇)) | ||
Theorem | erngdvlem1-rN 38134* | Lemma for eringring 38130. (Contributed by NM, 4-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRingR‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Grp) | ||
Theorem | erngdvlem2-rN 38135* | Lemma for eringring 38130. (Contributed by NM, 6-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRingR‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Abel) | ||
Theorem | erngdvlem3-rN 38136* | Lemma for eringring 38130. (Contributed by NM, 6-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRingR‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) & ⊢ 𝑀 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑏 ∘ 𝑎)) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Ring) | ||
Theorem | erngdvlem4-rN 38137* | Lemma for erngdv 38131. (Contributed by NM, 11-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRingR‘𝐾)‘𝑊) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))) & ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) & ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ◡(𝑎‘𝑓))) & ⊢ 𝑀 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑏 ∘ 𝑎)) & ⊢ ∨ = (join‘𝐾) & ⊢ ∧ = (meet‘𝐾) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑄 = ((oc‘𝐾)‘𝑊) & ⊢ 𝑍 = ((𝑄 ∨ (𝑅‘𝑏)) ∧ ((ℎ‘𝑄) ∨ (𝑅‘(𝑏 ∘ ◡(𝑠‘ℎ))))) & ⊢ 𝑌 = ((𝑄 ∨ (𝑅‘𝑔)) ∧ (𝑍 ∨ (𝑅‘(𝑔 ∘ ◡𝑏)))) & ⊢ 𝑋 = (℩𝑧 ∈ 𝑇 ∀𝑏 ∈ 𝑇 ((𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘(𝑠‘ℎ)) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝑔)) → (𝑧‘𝑄) = 𝑌)) & ⊢ 𝑈 = (𝑔 ∈ 𝑇 ↦ if((𝑠‘ℎ) = ℎ, 𝑔, 𝑋)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (ℎ ∈ 𝑇 ∧ ℎ ≠ ( I ↾ 𝐵))) → 𝐷 ∈ DivRing) | ||
Theorem | erngring-rN 38138 | An endomorphism ring is a ring. TODO: fix comment. (Contributed by NM, 4-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRingR‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Ring) | ||
Theorem | erngdv-rN 38139 | An endomorphism ring is a division ring. TODO: fix comment. (Contributed by NM, 11-Aug-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRingR‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ DivRing) | ||
Syntax | cdveca 38140 | Extend class notation with constructed vector space A. |
class DVecA | ||
Definition | df-dveca 38141* | Define constructed partial vector space A. (Contributed by NM, 8-Oct-2013.) |
⊢ DVecA = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ ({〈(Base‘ndx), ((LTrn‘𝑘)‘𝑤)〉, 〈(+g‘ndx), (𝑓 ∈ ((LTrn‘𝑘)‘𝑤), 𝑔 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑓 ∘ 𝑔))〉, 〈(Scalar‘ndx), ((EDRing‘𝑘)‘𝑤)〉} ∪ {〈( ·𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝑘)‘𝑤), 𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ↦ (𝑠‘𝑓))〉}))) | ||
Theorem | dvafset 38142* | The constructed partial vector space A for a lattice 𝐾. (Contributed by NM, 8-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ (𝐾 ∈ 𝑉 → (DVecA‘𝐾) = (𝑤 ∈ 𝐻 ↦ ({〈(Base‘ndx), ((LTrn‘𝐾)‘𝑤)〉, 〈(+g‘ndx), (𝑓 ∈ ((LTrn‘𝐾)‘𝑤), 𝑔 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑓 ∘ 𝑔))〉, 〈(Scalar‘ndx), ((EDRing‘𝐾)‘𝑤)〉} ∪ {〈( ·𝑠 ‘ndx), (𝑠 ∈ ((TEndo‘𝐾)‘𝑤), 𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ↦ (𝑠‘𝑓))〉}))) | ||
Theorem | dvaset 38143* | The constructed partial vector space A for a lattice 𝐾. (Contributed by NM, 8-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝑈 = ({〈(Base‘ndx), 𝑇〉, 〈(+g‘ndx), (𝑓 ∈ 𝑇, 𝑔 ∈ 𝑇 ↦ (𝑓 ∘ 𝑔))〉, 〈(Scalar‘ndx), 𝐷〉} ∪ {〈( ·𝑠 ‘ndx), (𝑠 ∈ 𝐸, 𝑓 ∈ 𝑇 ↦ (𝑠‘𝑓))〉})) | ||
Theorem | dvasca 38144 | The ring base set of the constructed partial vector space A are all translation group endomorphisms (for a fiducial co-atom 𝑊). (Contributed by NM, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) ⇒ ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝐹 = 𝐷) | ||
Theorem | dvabase 38145 | The ring base set of the constructed partial vector space A are all translation group endomorphisms (for a fiducial co-atom 𝑊). (Contributed by NM, 9-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) & ⊢ 𝐶 = (Base‘𝐹) ⇒ ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝐶 = 𝐸) | ||
Theorem | dvafplusg 38146* | Ring addition operation for the constructed partial vector space A. (Contributed by NM, 9-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) & ⊢ + = (+g‘𝐹) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → + = (𝑠 ∈ 𝐸, 𝑡 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓))))) | ||
Theorem | dvaplusg 38147* | Ring addition operation for the constructed partial vector space A. (Contributed by NM, 11-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) & ⊢ + = (+g‘𝐹) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝑆 ∈ 𝐸)) → (𝑅 + 𝑆) = (𝑓 ∈ 𝑇 ↦ ((𝑅‘𝑓) ∘ (𝑆‘𝑓)))) | ||
Theorem | dvaplusgv 38148 | Ring addition operation for the constructed partial vector space A. (Contributed by NM, 11-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) & ⊢ + = (+g‘𝐹) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝑆 ∈ 𝐸 ∧ 𝐺 ∈ 𝑇)) → ((𝑅 + 𝑆)‘𝐺) = ((𝑅‘𝐺) ∘ (𝑆‘𝐺))) | ||
Theorem | dvafmulr 38149* | Ring multiplication operation for the constructed partial vector space A. (Contributed by NM, 9-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) & ⊢ · = (.r‘𝐹) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → · = (𝑠 ∈ 𝐸, 𝑡 ∈ 𝐸 ↦ (𝑠 ∘ 𝑡))) | ||
Theorem | dvamulr 38150 | Ring multiplication operation for the constructed partial vector space A. (Contributed by NM, 11-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐹 = (Scalar‘𝑈) & ⊢ · = (.r‘𝐹) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝑆 ∈ 𝐸)) → (𝑅 · 𝑆) = (𝑅 ∘ 𝑆)) | ||
Theorem | dvavbase 38151 | The vectors (vector base set) of the constructed partial vector space A are all translations (for a fiducial co-atom 𝑊). (Contributed by NM, 9-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝑉 = (Base‘𝑈) ⇒ ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → 𝑉 = 𝑇) | ||
Theorem | dvafvadd 38152* | The vector sum operation for the constructed partial vector space A. (Contributed by NM, 9-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ + = (+g‘𝑈) ⇒ ⊢ ((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) → + = (𝑓 ∈ 𝑇, 𝑔 ∈ 𝑇 ↦ (𝑓 ∘ 𝑔))) | ||
Theorem | dvavadd 38153 | Ring addition operation for the constructed partial vector space A. (Contributed by NM, 11-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ + = (+g‘𝑈) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝐹 + 𝐺) = (𝐹 ∘ 𝐺)) | ||
Theorem | dvafvsca 38154* | Ring addition operation for the constructed partial vector space A. (Contributed by NM, 9-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ · = ( ·𝑠 ‘𝑈) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → · = (𝑠 ∈ 𝐸, 𝑓 ∈ 𝑇 ↦ (𝑠‘𝑓))) | ||
Theorem | dvavsca 38155 | Ring addition operation for the constructed partial vector space A. (Contributed by NM, 11-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ · = ( ·𝑠 ‘𝑈) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑅 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇)) → (𝑅 · 𝐹) = (𝑅‘𝐹)) | ||
Theorem | tendospcl 38156 | Closure of endomorphism scalar product operation. (Contributed by NM, 10-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑈 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → (𝑈‘𝐹) ∈ 𝑇) | ||
Theorem | tendospass 38157 | Associative law for endomorphism scalar product operation. (Contributed by NM, 10-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑋 ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇)) → ((𝑈 ∘ 𝑉)‘𝐹) = (𝑈‘(𝑉‘𝐹))) | ||
Theorem | tendospdi1 38158 | Forward distributive law for endomorphism scalar product operation. (Contributed by NM, 10-Oct-2013.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑈 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → (𝑈‘(𝐹 ∘ 𝐺)) = ((𝑈‘𝐹) ∘ (𝑈‘𝐺))) | ||
Theorem | tendocnv 38159 | Converse of a trace-preserving endomorphism value. (Contributed by NM, 7-Apr-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → ◡(𝑆‘𝐹) = (𝑆‘◡𝐹)) | ||
Theorem | tendospdi2 38160* | Reverse distributive law for endomorphism scalar product operation. (Contributed by NM, 10-Oct-2013.) |
⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑃 = (𝑠 ∈ 𝐸, 𝑡 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑠‘𝑓) ∘ (𝑡‘𝑓)))) ⇒ ⊢ ((𝑈 ∈ 𝐸 ∧ 𝑉 ∈ 𝐸 ∧ 𝐹 ∈ 𝑇) → ((𝑈𝑃𝑉)‘𝐹) = ((𝑈‘𝐹) ∘ (𝑉‘𝐹))) | ||
Theorem | tendospcanN 38161* | Cancellation law for trace-preserving endomorphism values (used as scalar product). (Contributed by NM, 7-Apr-2014.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝑂 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵)) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ∈ 𝐸 ∧ 𝑆 ≠ 𝑂) ∧ (𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇)) → ((𝑆‘𝐹) = (𝑆‘𝐺) ↔ 𝐹 = 𝐺)) | ||
Theorem | dvaabl 38162 | The constructed partial vector space A for a lattice 𝐾 is an abelian group. (Contributed by NM, 11-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑈 ∈ Abel) | ||
Theorem | dvalveclem 38163 | Lemma for dvalvec 38164. (Contributed by NM, 11-Oct-2013.) (Proof shortened by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ + = (+g‘𝑈) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝐷 = (Scalar‘𝑈) & ⊢ 𝐵 = (Base‘𝐾) & ⊢ ⨣ = (+g‘𝐷) & ⊢ × = (.r‘𝐷) & ⊢ · = ( ·𝑠 ‘𝑈) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑈 ∈ LVec) | ||
Theorem | dvalvec 38164 | The constructed partial vector space A for a lattice 𝐾 is a left vector space. (Contributed by NM, 11-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑈 ∈ LVec) | ||
Theorem | dva0g 38165 | The zero vector of partial vector space A. (Contributed by NM, 9-Sep-2014.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 0 = (0g‘𝑈) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 0 = ( I ↾ 𝐵)) | ||
Syntax | cdia 38166 | Extend class notation with partial isomorphism A. |
class DIsoA | ||
Definition | df-disoa 38167* | Define partial isomorphism A. (Contributed by NM, 15-Oct-2013.) |
⊢ DIsoA = (𝑘 ∈ V ↦ (𝑤 ∈ (LHyp‘𝑘) ↦ (𝑥 ∈ {𝑦 ∈ (Base‘𝑘) ∣ 𝑦(le‘𝑘)𝑤} ↦ {𝑓 ∈ ((LTrn‘𝑘)‘𝑤) ∣ (((trL‘𝑘)‘𝑤)‘𝑓)(le‘𝑘)𝑥}))) | ||
Theorem | diaffval 38168* | The partial isomorphism A for a lattice 𝐾. (Contributed by NM, 15-Oct-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) ⇒ ⊢ (𝐾 ∈ 𝑉 → (DIsoA‘𝐾) = (𝑤 ∈ 𝐻 ↦ (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑤} ↦ {𝑓 ∈ ((LTrn‘𝐾)‘𝑤) ∣ (((trL‘𝐾)‘𝑤)‘𝑓) ≤ 𝑥}))) | ||
Theorem | diafval 38169* | The partial isomorphism A for a lattice 𝐾. (Contributed by NM, 15-Oct-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 = (𝑥 ∈ {𝑦 ∈ 𝐵 ∣ 𝑦 ≤ 𝑊} ↦ {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑥})) | ||
Theorem | diaval 38170* | The partial isomorphism A for a lattice 𝐾. Definition of isomorphism map in [Crawley] p. 120 line 24. (Contributed by NM, 15-Oct-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = {𝑓 ∈ 𝑇 ∣ (𝑅‘𝑓) ≤ 𝑋}) | ||
Theorem | diaelval 38171 | Member of the partial isomorphism A for a lattice 𝐾. (Contributed by NM, 3-Dec-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐹 ∈ (𝐼‘𝑋) ↔ (𝐹 ∈ 𝑇 ∧ (𝑅‘𝐹) ≤ 𝑋))) | ||
Theorem | diafn 38172* | Functionality and domain of the partial isomorphism A. (Contributed by NM, 26-Nov-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → 𝐼 Fn {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊}) | ||
Theorem | diadm 38173* | Domain of the partial isomorphism A. (Contributed by NM, 3-Dec-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → dom 𝐼 = {𝑥 ∈ 𝐵 ∣ 𝑥 ≤ 𝑊}) | ||
Theorem | diaeldm 38174 | Member of domain of the partial isomorphism A. (Contributed by NM, 4-Dec-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) → (𝑋 ∈ dom 𝐼 ↔ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊))) | ||
Theorem | diadmclN 38175 | A member of domain of the partial isomorphism A is a lattice element. (Contributed by NM, 5-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ∈ 𝐵) | ||
Theorem | diadmleN 38176 | A member of domain of the partial isomorphism A is under the fiducial hyperplane. (Contributed by NM, 5-Dec-2013.) (New usage is discouraged.) |
⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → 𝑋 ≤ 𝑊) | ||
Theorem | dian0 38177 | The value of the partial isomorphism A is not empty. (Contributed by NM, 17-Jan-2014.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) ≠ ∅) | ||
Theorem | dia0eldmN 38178 | The lattice zero belongs to the domain of partial isomorphism A. (Contributed by NM, 5-Dec-2013.) (New usage is discouraged.) |
⊢ 0 = (0.‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 0 ∈ dom 𝐼) | ||
Theorem | dia1eldmN 38179 | The fiducial hyperplane (the largest allowed lattice element) belongs to the domain of partial isomorphism A. (Contributed by NM, 5-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑊 ∈ dom 𝐼) | ||
Theorem | diass 38180 | The value of the partial isomorphism A is a set of translations i.e. a set of vectors. (Contributed by NM, 26-Nov-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) ⊆ 𝑇) | ||
Theorem | diael 38181 | A member of the value of the partial isomorphism A is a translation i.e. a vector. (Contributed by NM, 17-Jan-2014.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ 𝐹 ∈ (𝐼‘𝑋)) → 𝐹 ∈ 𝑇) | ||
Theorem | diatrl 38182 | Trace of a member of the partial isomorphism A. (Contributed by NM, 17-Jan-2014.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ 𝐹 ∈ (𝐼‘𝑋)) → (𝑅‘𝐹) ≤ 𝑋) | ||
Theorem | diaelrnN 38183 | Any value of the partial isomorphism A is a set of translations i.e. a set of vectors. (Contributed by NM, 26-Nov-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑆 ∈ ran 𝐼) → 𝑆 ⊆ 𝑇) | ||
Theorem | dialss 38184 | The value of partial isomorphism A is a subspace of partial vector space A. Part of Lemma M of [Crawley] p. 120 line 26. (Contributed by NM, 17-Jan-2014.) (Revised by Mario Carneiro, 23-Jun-2014.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) & ⊢ 𝑆 = (LSubSp‘𝑈) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) ∈ 𝑆) | ||
Theorem | diaord 38185 | The partial isomorphism A for a lattice 𝐾 is order-preserving in the region under co-atom 𝑊. Part of Lemma M of [Crawley] p. 120 line 28. (Contributed by NM, 26-Nov-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ((𝐼‘𝑋) ⊆ (𝐼‘𝑌) ↔ 𝑋 ≤ 𝑌)) | ||
Theorem | dia11N 38186 | The partial isomorphism A for a lattice 𝐾 is one-to-one in the region under co-atom 𝑊. Part of Lemma M of [Crawley] p. 120 line 28. (Contributed by NM, 25-Nov-2013.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≤ 𝑊)) → ((𝐼‘𝑋) = (𝐼‘𝑌) ↔ 𝑋 = 𝑌)) | ||
Theorem | diaf11N 38187 | The partial isomorphism A for a lattice 𝐾 is a one-to-one function. Part of Lemma M of [Crawley] p. 120 line 27. (Contributed by NM, 4-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐼:dom 𝐼–1-1-onto→ran 𝐼) | ||
Theorem | diaclN 38188 | Closure of partial isomorphism A for a lattice 𝐾. (Contributed by NM, 4-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ dom 𝐼) → (𝐼‘𝑋) ∈ ran 𝐼) | ||
Theorem | diacnvclN 38189 | Closure of partial isomorphism A converse. (Contributed by NM, 6-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ ran 𝐼) → (◡𝐼‘𝑋) ∈ dom 𝐼) | ||
Theorem | dia0 38190 | The value of the partial isomorphism A at the lattice zero is the singleton of the identity translation i.e. the zero subspace. (Contributed by NM, 26-Nov-2013.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ 0 = (0.‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐼‘ 0 ) = {( I ↾ 𝐵)}) | ||
Theorem | dia1N 38191 | The value of the partial isomorphism A at the fiducial co-atom is the set of all translations i.e. the entire vector space. (Contributed by NM, 26-Nov-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐼‘𝑊) = 𝑇) | ||
Theorem | dia1elN 38192 | The largest subspace in the range of partial isomorphism A. (Contributed by NM, 5-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑇 ∈ ran 𝐼) | ||
Theorem | diaglbN 38193* | Partial isomorphism A of a lattice glb. (Contributed by NM, 3-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐺 = (glb‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ dom 𝐼 ∧ 𝑆 ≠ ∅)) → (𝐼‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝐼‘𝑥)) | ||
Theorem | diameetN 38194 | Partial isomorphism A of a lattice meet. (Contributed by NM, 5-Dec-2013.) (New usage is discouraged.) |
⊢ ∧ = (meet‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ dom 𝐼 ∧ 𝑌 ∈ dom 𝐼)) → (𝐼‘(𝑋 ∧ 𝑌)) = ((𝐼‘𝑋) ∩ (𝐼‘𝑌))) | ||
Theorem | diainN 38195 | Inverse partial isomorphism A of an intersection. (Contributed by NM, 6-Dec-2013.) (New usage is discouraged.) |
⊢ ∧ = (meet‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ ran 𝐼 ∧ 𝑌 ∈ ran 𝐼)) → (𝑋 ∩ 𝑌) = (𝐼‘((◡𝐼‘𝑋) ∧ (◡𝐼‘𝑌)))) | ||
Theorem | diaintclN 38196 | The intersection of partial isomorphism A closed subspaces is a closed subspace. (Contributed by NM, 3-Dec-2013.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑆 ⊆ ran 𝐼 ∧ 𝑆 ≠ ∅)) → ∩ 𝑆 ∈ ran 𝐼) | ||
Theorem | diasslssN 38197 | The partial isomorphism A maps to subspaces of partial vector space A. (Contributed by NM, 17-Jan-2014.) (New usage is discouraged.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) & ⊢ 𝑆 = (LSubSp‘𝑈) ⇒ ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ran 𝐼 ⊆ 𝑆) | ||
Theorem | diassdvaN 38198 | The partial isomorphism A maps to a set of vectors in partial vector space A. (Contributed by NM, 1-Jan-2014.) (New usage is discouraged.) |
⊢ 𝐵 = (Base‘𝐾) & ⊢ ≤ = (le‘𝐾) & ⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝑉 = (Base‘𝑈) ⇒ ⊢ (((𝐾 ∈ 𝑌 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) ⊆ 𝑉) | ||
Theorem | dia1dim 38199* | Two expressions for the 1-dimensional subspaces of partial vector space A (when 𝐹 is a nonzero vector i.e. non-identity translation). Remark after Lemma L in [Crawley] p. 120 line 21. (Contributed by NM, 15-Oct-2013.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝐼‘(𝑅‘𝐹)) = {𝑔 ∣ ∃𝑠 ∈ 𝐸 𝑔 = (𝑠‘𝐹)}) | ||
Theorem | dia1dim2 38200 | Two expressions for a 1-dimensional subspace of partial vector space A (when 𝐹 is a nonzero vector i.e. non-identity translation). (Contributed by NM, 15-Jan-2014.) (Revised by Mario Carneiro, 22-Jun-2014.) |
⊢ 𝐻 = (LHyp‘𝐾) & ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) & ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) & ⊢ 𝑈 = ((DVecA‘𝐾)‘𝑊) & ⊢ 𝐼 = ((DIsoA‘𝐾)‘𝑊) & ⊢ 𝑁 = (LSpan‘𝑈) ⇒ ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝐼‘(𝑅‘𝐹)) = (𝑁‘{𝐹})) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |