internlm/Lean-Github huggingface dataset:
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
⊢ DefinedWithParam (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v))
    (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁ ⋏
              HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂ ⋏
                HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃ ⋏
                  HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄ ⋏
                    HSemiformula.rew [→ #0, #1, #2, #3] p).ex.ex.ex.ex
Tactic:
intro v
Proof state after:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁ ⋏
                  HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂ ⋏
                    HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃ ⋏
                      HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄ ⋏
                        HSemiformula.rew [→ #0, #1, #2, #3] p).ex.ex.ex.ex.val
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁ ⋏
                  HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂ ⋏
                    HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃ ⋏
                      HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄ ⋏
                        HSemiformula.rew [→ #0, #1, #2, #3] p).ex.ex.ex.ex.val
Tactic:
simp [hp.df.iff, hpf₁.df.iff, hpf₂.df.iff, hpf₃.df.iff, hpf₄.df.iff]
Proof state after:
no goals
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
hP : DefinableRel₄ L (𝚷, m + 1) P
⊢ Definable L (𝚷, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)
Tactic:
rcases hP with ⟨p, hp⟩
Proof state after:
case mk.intro
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚷, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
⊢ Definable L (𝚷, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚷, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
⊢ DefinedWithParam (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v))
    ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁).negSigma ⋎
              (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂).negSigma ⋎
                (HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃).negSigma ⋎
                  (HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄).negSigma ⋎
                    HSemiformula.rew [→ #0, #1, #2, #3] p).all.all.all.all
Tactic:
intro v
Proof state after:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚷, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁).negSigma ⋎
                  (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂).negSigma ⋎
                    (HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃).negSigma ⋎
                      (HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄).negSigma ⋎
                        HSemiformula.rew [→ #0, #1, #2, #3] p).all.all.all.all.val
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚷, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁).negSigma ⋎
                  (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂).negSigma ⋎
                    (HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃).negSigma ⋎
                      (HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄).negSigma ⋎
                        HSemiformula.rew [→ #0, #1, #2, #3] p).all.all.all.all.val
Tactic:
simp [hp.df.iff, hpf₁.df.iff, hpf₂.df.iff, hpf₃.df.iff, hpf₄.df.iff, ←imp_iff_not_or]
Proof state after:
no goals
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
hP : DefinableRel₄ L (𝚫, m + 1) P
⊢ Definable L (𝚫, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)
Tactic:
rcases hP with ⟨p, hp⟩
Proof state after:
case mk.intro
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
⊢ Definable L (𝚫, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
⊢ DefinedWithParam (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v))
    (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁ ⋏
              HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂ ⋏
                HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃ ⋏
                  HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄ ⋏
                    HSemiformula.rew [→ #0, #1, #2, #3] p.sigma).ex.ex.ex.ex
Tactic:
intro v
Proof state after:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁ ⋏
                  HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂ ⋏
                    HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃ ⋏
                      HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄ ⋏
                        HSemiformula.rew [→ #0, #1, #2, #3] p.sigma).ex.ex.ex.ex.val
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁ ⋏
                  HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂ ⋏
                    HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃ ⋏
                      HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄ ⋏
                        HSemiformula.rew [→ #0, #1, #2, #3] p.sigma).ex.ex.ex.ex.val
Tactic:
simp [hp.df.iff, hpf₁.df.iff, hpf₂.df.iff, hpf₃.df.iff, hpf₄.df.iff, HSemiformula.val_sigma]
Proof state after:
no goals
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
⊢ DefinedWithParam (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v))
    ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁).negSigma ⋎
              (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂).negSigma ⋎
                (HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃).negSigma ⋎
                  (HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄).negSigma ⋎
                    HSemiformula.rew [→ #0, #1, #2, #3] p.pi).all.all.all.all
Tactic:
intro v
Proof state after:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁).negSigma ⋎
                  (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂).negSigma ⋎
                    (HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃).negSigma ⋎
                      (HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄).negSigma ⋎
                        HSemiformula.rew [→ #0, #1, #2, #3] p.pi).all.all.all.all.val
Theorem: Arith.Model.Definable.comp₄
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ✝ : HierarchySymbol
k✝ : ℕ
P✝ Q : (Fin k✝ → M) → Prop
m k : ℕ
P : M → M → M → M → Prop
f₁ f₂ f₃ f₄ : (Fin k → M) → M
Γ : SigmaPiDelta
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
pf₂ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₂ : DefinedWithParam (fun v => v 0 = f₂ fun x => v x.succ) pf₂
pf₃ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₃ : DefinedWithParam (fun v => v 0 = f₃ fun x => v x.succ) pf₃
pf₄ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₄ : DefinedWithParam (fun v => v 0 = f₄ fun x => v x.succ) pf₄
p : HSemiformula L M 4 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2) (v 3)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v) (f₄ v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ.succ)) pf₁).negSigma ⋎
                  (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ.succ)) pf₂).negSigma ⋎
                    (HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ.succ)) pf₃).negSigma ⋎
                      (HSemiformula.rew (Rew.substs (#3 :> fun x => #x.succ.succ.succ.succ)) pf₄).negSigma ⋎
                        HSemiformula.rew [→ #0, #1, #2, #3] p.pi).all.all.all.all.val
Tactic:
simp [hp.df.iff, hpf₁.df.iff, hpf₂.df.iff, hpf₃.df.iff, hpf₄.df.iff, ←imp_iff_not_or, hp.proper.iff']
Proof state after:
no goals
Theorem: Arith.Model.DefinablePred.of_iff
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ : HierarchySymbol
k : ℕ
P✝ Q✝ : (Fin k → M) → Prop
P Q : M → Prop
h : ∀ (x : M), P x ↔ Q x
H : DefinablePred L Γ Q
⊢ DefinablePred L Γ P
Tactic:
rwa [show P = Q from by funext v; simp [h]]
Proof state after:
no goals
Theorem: Arith.Model.DefinablePred.of_iff
Proof state before:
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ : HierarchySymbol
k : ℕ
P✝ Q✝ : (Fin k → M) → Prop
P Q : M → Prop
h : ∀ (x : M), P x ↔ Q x
H : DefinablePred L Γ Q
⊢ P = Q
Tactic:
funext v
Proof state after:
case h
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ : HierarchySymbol
k : ℕ
P✝ Q✝ : (Fin k → M) → Prop
P Q : M → Prop
h : ∀ (x : M), P x ↔ Q x
H : DefinablePred L Γ Q
v : M
⊢ P v = Q v
Theorem: Arith.Model.DefinablePred.of_iff
Proof state before:
case h
L : Language
inst✝⁹ : L.ORing
ξ : Type v
n : ℕ
M : Type u_1
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ : HierarchySymbol
k : ℕ
P✝ Q✝ : (Fin k → M) → Prop
P Q : M → Prop
h : ∀ (x : M), P x ↔ Q x
H : DefinablePred L Γ Q
v : M
⊢ P v = Q v
Tactic:
simp [h]
Proof state after:
no goals