Documentation

Foundation.FirstOrder.Arithmetic.Schemata

Induction schemata of Arithmetic #

def LO.FirstOrder.Arithmetic.orderInd {L : Language} [L.ORing] {ΞΎ : Type u_3} (Ο† : Semiformula L ΞΎ 1) :
Formula L ΞΎ
Equations
  • One or more equations did not get rendered due to their size.
Instances For
    def LO.FirstOrder.Arithmetic.leastNumber {L : Language} [L.ORing] {ΞΎ : Type u_3} (Ο† : Semiformula L ΞΎ 1) :
    Formula L ΞΎ
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        Equations
        Instances For
          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              Equations
              Instances For
                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  Equations
                  Instances For
                    Equations
                    Instances For
                      Equations
                      Instances For
                        theorem LO.FirstOrder.Arithmetic.ISigma_subset_mono {s₁ sβ‚‚ : β„•} (h : s₁ ≀ sβ‚‚) :
                        π—œπšΊs₁ βŠ† π—œπšΊsβ‚‚
                        theorem LO.FirstOrder.Arithmetic.InductionScheme.succ_induction {V : Type u_1} [ORingStructure V] {C : ArithmeticSemiformula β„• 1 β†’ Prop} [V↓[β„’β‚’α΅£] ⊧* InductionScheme β„’β‚’α΅£ C] {P : V β†’ Prop} (hP : βˆƒ (e : β„• β†’ V) (Ο† : ArithmeticSemiformula β„• 1), C Ο† ∧ βˆ€ (x : V), P x ↔ (Semiformula.Eval ![x] e) Ο†) :
                        P 0 β†’ (βˆ€ (x : V), P x β†’ P (x + 1)) β†’ βˆ€ (x : V), P x
                        theorem LO.FirstOrder.Arithmetic.InductionOnHierarchy.succ_induction {V : Type u_1} [ORingStructure V] (Ξ“ : Polarity) (m : β„•) [V↓[β„’β‚’α΅£] ⊧* π—œπ—‘π—— Ξ“ m] {P : V β†’ Prop} (hP : { Ξ“ := Ξ“.coe, rank := m }-Predicate P) (zero : P 0) (succ : βˆ€ (x : V), P x β†’ P (x + 1)) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.InductionOnHierarchy.order_induction {V : Type u_1} [ORingStructure V] (Ξ“ : Polarity) (m : β„•) [V↓[β„’β‚’α΅£] ⊧* π—œπ—‘π—— Ξ“ m] {P : V β†’ Prop} (hP : { Ξ“ := Ξ“.coe, rank := m }-Predicate P) (ind : βˆ€ (x : V), (βˆ€ y < x, P y) β†’ P x) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.InductionOnHierarchy.least_number {V : Type u_1} [ORingStructure V] (Ξ“ : Polarity) (m : β„•) [V↓[β„’β‚’α΅£] ⊧* π—œπ—‘π—— Ξ“ m] {P : V β†’ Prop} (hP : { Ξ“ := Ξ“.coe, rank := m }-Predicate P) {x : V} (h : P x) :
                        βˆƒ (y : V), P y ∧ βˆ€ z < y, Β¬P z
                        theorem LO.FirstOrder.Arithmetic.InductionOnHierarchy.succ_induction_sigma {V : Type u_1} [ORingStructure V] (Ξ“ : SigmaPiDelta) (m : β„•) [V↓[β„’β‚’α΅£] ⊧* π—œπ—‘π—— 𝚺 m] {P : V β†’ Prop} (hP : { Ξ“ := Ξ“, rank := m }-Predicate P) (zero : P 0) (succ : βˆ€ (x : V), P x β†’ P (x + 1)) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.InductionOnHierarchy.order_induction_sigma {V : Type u_1} [ORingStructure V] (Ξ“ : SigmaPiDelta) (m : β„•) [V↓[β„’β‚’α΅£] ⊧* π—œπ—‘π—— 𝚺 m] {P : V β†’ Prop} (hP : { Ξ“ := Ξ“, rank := m }-Predicate P) (ind : βˆ€ (x : V), (βˆ€ y < x, P y) β†’ P x) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.InductionOnHierarchy.least_number_sigma {V : Type u_1} [ORingStructure V] (Ξ“ : SigmaPiDelta) (m : β„•) [V↓[β„’β‚’α΅£] ⊧* π—œπ—‘π—— 𝚺 m] {P : V β†’ Prop} (hP : { Ξ“ := Ξ“, rank := m }-Predicate P) {x : V} (h : P x) :
                        βˆƒ (y : V), P y ∧ βˆ€ z < y, Β¬P z
                        theorem LO.FirstOrder.Arithmetic.ISigma0.succ_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚€] {P : V β†’ Prop} (hP : πšΊβ‚€-Predicate P) (zero : P 0) (succ : βˆ€ (x : V), P x β†’ P (x + 1)) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma1.sigma1_succ_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚] {P : V β†’ Prop} (hP : πšΊβ‚-Predicate P) (zero : P 0) (succ : βˆ€ (x : V), P x β†’ P (x + 1)) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma1.pi1_succ_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚] {P : V β†’ Prop} (hP : πš·β‚-Predicate P) (zero : P 0) (succ : βˆ€ (x : V), P x β†’ P (x + 1)) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma0.order_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚€] {P : V β†’ Prop} (hP : πšΊβ‚€-Predicate P) (ind : βˆ€ (x : V), (βˆ€ y < x, P y) β†’ P x) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma1.sigma1_order_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚] {P : V β†’ Prop} (hP : πšΊβ‚-Predicate P) (ind : βˆ€ (x : V), (βˆ€ y < x, P y) β†’ P x) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma1.pi1_order_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚] {P : V β†’ Prop} (hP : πš·β‚-Predicate P) (ind : βˆ€ (x : V), (βˆ€ y < x, P y) β†’ P x) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma0.least_number {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚€] {P : V β†’ Prop} (hP : πšΊβ‚€-Predicate P) {x : V} (h : P x) :
                        βˆƒ (y : V), P y ∧ βˆ€ z < y, Β¬P z
                        theorem LO.FirstOrder.Arithmetic.ISigma1.succ_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚] (Ξ“ : SigmaPiDelta) {P : V β†’ Prop} (hP : { Ξ“ := Ξ“, rank := 1 }-Predicate P) (zero : P 0) (succ : βˆ€ (x : V), P x β†’ P (x + 1)) (x : V) :
                        P x
                        theorem LO.FirstOrder.Arithmetic.ISigma1.order_induction {V : Type u_1} [ORingStructure V] [V↓[β„’β‚’α΅£] ⊧* π—œπšΊβ‚] (Ξ“ : SigmaPiDelta) {P : V β†’ Prop} (hP : { Ξ“ := Ξ“, rank := 1 }-Predicate P) (ind : βˆ€ (x : V), (βˆ€ y < x, P y) β†’ P x) (x : V) :
                        P x
                        @[reducible, inline]
                        Equations
                        • β‹― = β‹―
                        Instances For