Documentation

LeanPool.Incompleteness.Arithmetization.ISigmaOne.Metamath.Proof.Thy

Thy #

Imported declaration from the Incompleteness formalization.

  • Imported declaration from the Incompleteness formalization.

Instances For
    structure LO.Arith.Language.Theory {V : Type u_1} [ORingStruc V] (L : Arith.Language V) {pL : FirstOrder.Arith.LDef} [L.Defined pL] :
    Type u_1

    Imported declaration from the Incompleteness formalization.

    • set : Set V

      Imported declaration from the Incompleteness formalization.

    Instances For
      @[implicit_reducible]
      Equations
      @[implicit_reducible]
      Equations
      theorem LO.Arith.Language.Theory.mem_def {V : Type u_1} [ORingStruc V] (L : Arith.Language V) {pL : FirstOrder.Arith.LDef} [L.Defined pL] {T : L.Theory} {p : V} :
      p T p T.set

      Imported declaration from the Incompleteness formalization.

      Instances
        theorem LO.Arith.Language.Theory.mem_defined {V : Type u_1} [ORingStruc V] {L : Arith.Language V} {pL : FirstOrder.Arith.LDef} [L.Defined pL] (T : L.Theory) {pT : pL.TDef} [T.Defined pT] :

        Imported declaration from the Incompleteness formalization.