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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚷, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
v : Fin k → M
⊢ (fun v => P (f v) (g v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf).negSigma ⋎
              (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg).negSigma ⋎
                HSemiformula.rew [→ #0, #1] p).all.all.val
Tactic:
simp [hp.df.iff, hpf.df.iff, hpg.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 → Prop
f g : (Fin k → M) → M
hf : DefinableFunction L (𝚺, m + 1) f
hg : DefinableFunction L (𝚺, m + 1) g
Γ : SigmaPiDelta
hP : DefinableRel L (𝚫, m + 1) P
⊢ Definable L (𝚫, m + 1) fun v => P (f v) (g 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 → Prop
f g : (Fin k → M) → M
hf : DefinableFunction L (𝚺, m + 1) f
hg : DefinableFunction L (𝚺, m + 1) g
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
⊢ Definable L (𝚫, m + 1) fun v => P (f v) (g v)
Theorem: Arith.Model.Definable.comp₂
Proof state before:
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 → Prop
f g : (Fin k → M) → M
hf : DefinableFunction L (𝚺, m + 1) f
hg : DefinableFunction L (𝚺, m + 1) g
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
⊢ Definable L (𝚫, m + 1) fun v => P (f v) (g v)
Tactic:
rcases hf with ⟨pf, hpf⟩
Proof state after:
case mk.intro.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 → Prop
f g : (Fin k → M) → M
hg : DefinableFunction L (𝚺, m + 1) g
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
⊢ Definable L (𝚫, m + 1) fun v => P (f v) (g v)
Theorem: Arith.Model.Definable.comp₂
Proof state before:
case mk.intro.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 → Prop
f g : (Fin k → M) → M
hg : DefinableFunction L (𝚺, m + 1) g
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
⊢ Definable L (𝚫, m + 1) fun v => P (f v) (g v)
Tactic:
rcases hg with ⟨pg, hpg⟩
Proof state after:
case mk.intro.mk.intro.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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
⊢ Definable L (𝚫, m + 1) fun v => P (f v) (g 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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
⊢ DefinedWithParam (fun v => P (f v) (g v))
    (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf ⋏
          HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg ⋏ HSemiformula.rew [→ #0, #1] p.sigma).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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
v : Fin k → M
⊢ (fun v => P (f v) (g v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf ⋏
              HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg ⋏
                HSemiformula.rew [→ #0, #1] p.sigma).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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
v : Fin k → M
⊢ (fun v => P (f v) (g v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf ⋏
              HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg ⋏
                HSemiformula.rew [→ #0, #1] p.sigma).ex.ex.val
Tactic:
simp [hp.df.iff, hpf.df.iff, hpg.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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
⊢ DefinedWithParam (fun v => P (f v) (g v))
    ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf).negSigma ⋎
          (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg).negSigma ⋎
            HSemiformula.rew [→ #0, #1] p.pi).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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
v : Fin k → M
⊢ (fun v => P (f v) (g v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf).negSigma ⋎
              (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg).negSigma ⋎
                HSemiformula.rew [→ #0, #1] p.pi).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 → Prop
f g : (Fin k → M) → M
Γ : SigmaPiDelta
p : HSemiformula L M 2 (𝚫, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1)) p
pf : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf : DefinedWithParam (fun v => v 0 = f fun x => v x.succ) pf
pg : HSemiformula L M (k + 1) (𝚺, m + 1)
hpg : DefinedWithParam (fun v => v 0 = g fun x => v x.succ) pg
v : Fin k → M
⊢ (fun v => P (f v) (g v)) v ↔
    (Semiformula.Evalm M v id)
      ((HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ)) pf).negSigma ⋎
              (HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ)) pg).negSigma ⋎
                HSemiformula.rew [→ #0, #1] p.pi).all.all.val
Tactic:
simp [hp.df.iff, hpf.df.iff, hpg.df.iff, ←imp_iff_not_or, hp.proper.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 → Prop
f₁ f₂ f₃ : (Fin k → M) → M
hf₁ : DefinableFunction L (𝚺, m + 1) f₁
hf₂ : DefinableFunction L (𝚺, m + 1) f₂
hf₃ : DefinableFunction L (𝚺, m + 1) f₃
Γ : SigmaPiDelta
hP : DefinableRel₃ L (Γ, m + 1) P
⊢ Definable L (Γ, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v)
Tactic:
rcases hf₁ with ⟨pf₁, hpf₁⟩
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 → Prop
f₁ f₂ f₃ : (Fin k → M) → M
hf₂ : DefinableFunction L (𝚺, m + 1) f₂
hf₃ : DefinableFunction L (𝚺, m + 1) f₃
Γ : SigmaPiDelta
hP : DefinableRel₃ L (Γ, m + 1) P
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
⊢ Definable L (Γ, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v)
Theorem: Arith.Model.Definable.comp₃
Proof state before:
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 → Prop
f₁ f₂ f₃ : (Fin k → M) → M
hf₂ : DefinableFunction L (𝚺, m + 1) f₂
hf₃ : DefinableFunction L (𝚺, m + 1) f₃
Γ : SigmaPiDelta
hP : DefinableRel₃ L (Γ, m + 1) P
pf₁ : HSemiformula L M (k + 1) (𝚺, m + 1)
hpf₁ : DefinedWithParam (fun v => v 0 = f₁ fun x => v x.succ) pf₁
⊢ Definable L (Γ, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v)
Tactic:
rcases hf₂ with ⟨pf₂, hpf₂⟩
Proof state after:
case mk.intro.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 → Prop
f₁ f₂ f₃ : (Fin k → M) → M
hf₃ : DefinableFunction L (𝚺, m + 1) f₃
Γ : SigmaPiDelta
hP : DefinableRel₃ L (Γ, m + 1) P
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₂
⊢ Definable L (Γ, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v)
Theorem: Arith.Model.Definable.comp₃
Proof state before:
case mk.intro.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 → Prop
f₁ f₂ f₃ : (Fin k → M) → M
hf₃ : DefinableFunction L (𝚺, m + 1) f₃
Γ : SigmaPiDelta
hP : DefinableRel₃ L (Γ, m + 1) P
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₂
⊢ Definable L (Γ, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v)
Tactic:
rcases hf₃ with ⟨pf₃, hpf₃⟩
Proof state after:
case mk.intro.mk.intro.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 → Prop
f₁ f₂ f₃ : (Fin k → M) → M
Γ : SigmaPiDelta
hP : DefinableRel₃ L (Γ, m + 1) P
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₃
⊢ Definable L (Γ, m + 1) fun v => P (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 → Prop
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₃
hP : DefinableRel₃ L (𝚺, m + 1) P
⊢ Definable L (𝚺, m + 1) fun v => P (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 → Prop
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₃
p : HSemiformula L M 3 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2)) p
⊢ Definable L (𝚺, m + 1) fun v => P (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 → Prop
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₃
p : HSemiformula L M 3 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2)) p
⊢ DefinedWithParam (fun v => P (f₁ v) (f₂ v) (f₃ v))
    (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ)) pf₁ ⋏
            HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ)) pf₂ ⋏
              HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ)) pf₃ ⋏
                HSemiformula.rew [→ #0, #1, #2] p).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 → Prop
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₃
p : HSemiformula L M 3 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ)) pf₁ ⋏
                HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ)) pf₂ ⋏
                  HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ)) pf₃ ⋏
                    HSemiformula.rew [→ #0, #1, #2] p).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 → Prop
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₃
p : HSemiformula L M 3 (𝚺, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2)) p
v : Fin k → M
⊢ (fun v => P (f₁ v) (f₂ v) (f₃ v)) v ↔
    (Semiformula.Evalm M v id)
      (HSemiformula.rew (Rew.substs (#0 :> fun x => #x.succ.succ.succ)) pf₁ ⋏
                HSemiformula.rew (Rew.substs (#1 :> fun x => #x.succ.succ.succ)) pf₂ ⋏
                  HSemiformula.rew (Rew.substs (#2 :> fun x => #x.succ.succ.succ)) pf₃ ⋏
                    HSemiformula.rew [→ #0, #1, #2] p).ex.ex.ex.val
Tactic:
simp [hp.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 → Prop
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₃
hP : DefinableRel₃ L (𝚷, m + 1) P
⊢ Definable L (𝚷, m + 1) fun v => P (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 → Prop
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₃
p : HSemiformula L M 3 (𝚷, m + 1)
hp : DefinedWithParam (fun v => P (v 0) (v 1) (v 2)) p
⊢ Definable L (𝚷, m + 1) fun v => P (f₁ v) (f₂ v) (f₃ v)