AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orth

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.iInter_biorth_eq_orth_iUnion_orth {ι : Sort*} (G : ι → Set P) :
    (⋂ i, (G i)⫠⫠ : Set P) = (⋃ i, (G i)⫠)⫠
Formalizes
CSLib, `Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orth`
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.
What was changed in Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orth
--- Cslib/Logics/LinearLogic/CLL/PhaseSemantics/Basic.lean:137 (Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orth)
+++ 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 iInter_biorth_eq_orth_iUnion_orth {ι : 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.iInter_biorth_eq_orth_iUnion_orth {ι : Sort*} (G : ι → Set P) :
     (⋂ i, (G i)⫠⫠ : Set P) = (⋃ i, (G i)⫠)⫠ := by
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

Lean source view module on GitHub

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.iInter_biorth_eq_orth_iUnion_orth {ι : Sort*} (G : ι → Set P) :    (⋂ i, (G i)⫠⫠ : Set P) = (⋃ i, (G i)⫠)⫠ := by  simpa using (orth_iUnion (G := fun i => (G i)⫠)).symm
See it in the graphDiscuss this resultChallenge it