Mathlib Map

Theorems · Definition · logic and foundations

FirstOrder.Language.BoundedFormula.iff

{L : FirstOrder.Language} → {α : Type u'} → {n : ℕ} → L.BoundedFormula α n → L.BoundedFormula α n → L.BoundedFormula α n

The biimplication between two bounded formulas.

Defined in
Mathlib.ModelTheory.Syntax
Cited by
2 results in Mathlib
Foundations
Depth 6 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

FirstOrder.Language.Theory.Iff · cited by 32Theory.IffFirstOrder.Language.BoundedFormula.realize_iff · cited by 7BoundedFormula.realize_iffFirstOrder.Language.Formula.iff · cited by 2Formula.iffFirstOrder.Language.Theory.Iff.trans · cited by 0Iff.transFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaBoundedFormula.iffCITED BYCITES

Cites2

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by4

Results whose statement or proof uses this declaration.