Theorems · Theorem · logic and foundations
FirstOrder.Language.Theory.CompleteType.toList_foldr_inf_mem
∀ {L : FirstOrder.Language} {T : L.Theory} {α : Type w} {p : T.CompleteType α}
{t : Finset (L.withConstants α).Sentence}, List.foldr (fun x1 x2 => x1 ⊓ x2) ⊤ t.toList ∈ p ↔ ↑t ⊆ ↑p- Defined in
- Mathlib.ModelTheory.Types
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement · cited by 53,352
- Finsetstatement and proof · cited by 13,712
- Top.topstatement and proof · cited by 9,680
- SetLike.coestatement and proof · cited by 8,199
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.BoundedFormulaproof · cited by 207
- FirstOrder.Language.Theorystatement and proof · cited by 154
- FirstOrder.Language.Sentencestatement and proof · cited by 127
- FirstOrder.Language.withConstantsstatement and proof · cited by 108
- FirstOrder.Language.BoundedFormula.Realizeproof · cited by 104
- FirstOrder.Language.Theory.ModelTypeproof · cited by 62
- FirstOrder.Language.Theory.CompleteTypestatement and proof · cited by 35
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.