Cslib.Logic.CLL.PhaseSpace.orth_iUnion
theoremverifiedformalizationimported Lean
Given a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that (⋃ᵢ Gᵢ)⫠ = ⋂ᵢ Gᵢ⫠.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace in universe u v in open scoped Pointwise in open Set in attribute [local grind _=_] Set.le_iff_subset in variable {P : Type*} [PhaseSpace P] {p q : P} in lemma Cslib.Logic.CLL.PhaseSpace.orth_iUnion {ι : Sort*} (G : ι → Set P) : (⋃ i, G i)⫠ = ⋂ i, (G i)⫠
- Formalizes
- CSLib, `Cslib.Logic.CLL.PhaseSpace.orth_iUnion`
- Lean proof
- By Tanner Duve, Bhavik Mehta, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Tanner Duve. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.Logic.CLL.PhaseSpace.orth_iUnion← Cslib.Logic.CLL.PhaseSpace.orth_iUnion (Cslib/Logics/LinearLogic/CLL/PhaseSemantics/Basic.lean:121): adapted
What was changed in
Cslib.Logic.CLL.PhaseSpace.orth_iUnion--- Cslib/Logics/LinearLogic/CLL/PhaseSemantics/Basic.lean:121 (Cslib.Logic.CLL.PhaseSpace.orth_iUnion) +++ as compiled here @@ -1,6 +1,10 @@ -/-- -Given a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that -(⋃ᵢ Gᵢ)⫠ = ⋂ᵢ Gᵢ⫠. --/ -lemma orth_iUnion {ι : Sort*} (G : ι → Set P) : +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace in +universe u v in +open scoped Pointwise in +open Set in +attribute [local grind _=_] Set.le_iff_subset in +variable {P : Type*} [PhaseSpace P] {p q : P} in +lemma Cslib.Logic.CLL.PhaseSpace.orth_iUnion {ι : Sort*} (G : ι → Set P) : (⋃ i, G i)⫠ = ⋂ i, (G i)⫠ := by - Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- Cslib.Logic.CLL.PhaseSpace.orthogonal_defCslib.Logic.CLL.PhaseSpace.orthogonal_def
- Cslib.Logic.CLL.PhaseSpaceA phase space is a commutative monoid M equipped with a distinguished subset ⊥. This forms the algebraic foundation for interpreting…
- Cslib.Logic.CLL.PhaseSpace.orthogonalThe orthogonal
X⫠of a set X: the set of elements that map X into ⊥ under multiplication. - Cslib.Logic.CLL.Proposition.dualPropositional duality.
- Used by 1
- Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orthGiven a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that ∩ᵢ Gᵢ⫠⫠ = (∪ᵢ Gᵢ⫠)⫠.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option quotPrecheck falseopen Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace@[inherit_doc] local postfix:max "⫠" => orthogonalopen Cslib Cslib.Logic Cslib.Logic.CLL@[inherit_doc] local postfix:max "⫠" => Proposition.dualset_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.Logic Cslib.Logic.CLL Cslib.Logic.CLL.PhaseSpace inuniverse u v inopen scoped Pointwise inopen Set inattribute [local grind _=_] Set.le_iff_subset invariable {P : Type*} [PhaseSpace P] {p q : P} in/-- Given a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that (⋃ᵢ Gᵢ)⫠ = ⋂ᵢ Gᵢ⫠. -/lemma Cslib.Logic.CLL.PhaseSpace.orth_iUnion {ι : Sort*} (G : ι → Set P) : (⋃ i, G i)⫠ = ⋂ i, (G i)⫠ := by ext m; constructor · intro hm have hm' : ∀ x ∈ ⋃ j, G j, m * x ∈ PhaseSpace.bot := by grind refine mem_iInter.mpr (fun i => ?_) exact fun x hx => hm' x (mem_iUnion.mpr ⟨i, hx⟩) · intro hm x hx rcases mem_iUnion.mp hx with ⟨i, hix⟩ have hmi : m ∈ (G i)⫠ := mem_iInter.mp hm i grind