Theorems · Theorem · logic and foundations
FirstOrder.Language.BoundedFormula.realize_iff
∀ {L : FirstOrder.Language} {M : Type w} [inst : L.Structure M] {α : Type u'} {l : ℕ} {φ ψ : L.BoundedFormula α l}
{v : α → M} {xs : Fin l → M}, (φ.iff ψ).Realize v xs ↔ (φ.Realize v xs ↔ ψ.Realize v xs)- Defined in
- Mathlib.ModelTheory.Semantics
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.Structurestatement and proof · cited by 775
- FirstOrder.Language.BoundedFormulastatement and proof · cited by 207
- FirstOrder.Language.BoundedFormula.Realizestatement and proof · cited by 104
- FirstOrder.Language.BoundedFormula.iffstatement · cited by 2
Cited by7
Results whose statement or proof uses this declaration.
- FirstOrder.Language.Theory.Iff.realize_bd_iffproof · cited by 5
- FirstOrder.Language.BoundedFormula.iff_toPrenexproof · cited by 1
- FirstOrder.Language.Formula.realize_iffproof · cited by 1
- FirstOrder.Language.BoundedFormula.iff_all_liftAtproof · cited by 0
- FirstOrder.Language.Theory.Iff.reflproof · cited by 0
- FirstOrder.Language.Theory.Iff.symmproof · cited by 0
- FirstOrder.Language.Theory.Iff.transproof · cited by 0