Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.BoundedFormula.not_ex_isAtomic

∀ {L : FirstOrder.Language} {α : Type u'} {n : ℕ} (φ : L.BoundedFormula α (n + 1)), ¬φ.ex.IsAtomic
Defined in
Mathlib.ModelTheory.Complexity
Cited by
1 results in Mathlib
Foundations
Depth 12 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

FirstOrder.Language.BoundedFormula.not_ex_isQF · cited by 0BoundedFormula.not_ex_isQFFirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.BoundedFormula · cited by 207Language.BoundedFormulaFirstOrder.Language.Term · cited by 166Language.TermFirstOrder.Language.Relations · cited by 147Language.RelationsFirstOrder.Language.BoundedFormula.IsAtomic · cited by 22BoundedFormula.IsAtomicFirstOrder.Language.BoundedFormula.ex · cited by 14BoundedFormula.exFirstOrder.Language.Term.bdEqual · cited by 10Term.bdEqualFirstOrder.Language.Relations.boundedFormula · cited by 8Relations.boundedFormulaFirstOrder.Language.BoundedFormula.ctorIdx · cited by 4BoundedFormula.ctorIdxFirstOrder.Language.BoundedFormula.IsAtomic.casesOn · cited by 2IsAtomic.casesOnBoundedFormula.not_ex_isAtomicCITED BYCITES

Cites10

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

Cited by1

Results whose statement or proof uses this declaration.