AFTD Auto-Formalizing Theoretical Domains

LinearPMap.add_left_le_of_le

theoremverifiedformalizationimported Lean

LinearPMap.add_left_le_of_le

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Submodule in
variable {R : Type*} [Ring R] in
variable {E : Type*} [AddCommGroup E] [Module R E] in
variable {F : Type*} [AddCommGroup F] [Module R F] in
variable (f f₁ f₂ f₃ : E →ₗ.[R] F) {g g₁ g₂ : E →ₗ.[R] F} in
lemma LinearPMap.add_left_le_of_le (h : g₁ ≤ g₂) : f + g₁ ≤ f + g₂
Formalizes
Physlib, `LinearPMap.add_left_le_of_le`
Lean proof
By Gregory J. Loges, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2026 Gregory J. Loges. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Submodule invariable {R : Type*} [Ring R] invariable {E : Type*} [AddCommGroup E] [Module R E] invariable {F : Type*} [AddCommGroup F] [Module R F] invariable (f f₁ f₂ f₃ : E →ₗ.[R] F) {g g₁ g₂ : E →ₗ.[R] F} inlemma LinearPMap.add_left_le_of_le (h : g₁ ≤ g₂) : f + g₁ ≤ f + g₂ := by  constructor  · simp only [add_domain, le_inf_iff, inf_le_left, true_and]    exact (inf_le_of_right_le le_rfl).trans h.1  · intro x y hxy    simp_rw [add_apply, @h.2 ⟨x, x.2.2⟩ ⟨y, y.2.2⟩ hxy, hxy]
See it in the graphDiscuss this resultChallenge it