url
stringclasses
147 values
commit
stringclasses
147 values
file_path
stringlengths
7
101
full_name
stringlengths
1
94
start
stringlengths
6
10
end
stringlengths
6
11
tactic
stringlengths
1
11.2k
state_before
stringlengths
3
2.09M
state_after
stringlengths
6
2.09M
input
stringlengths
73
2.09M
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
let ⟨_, hB⟩ := (ih2 hΞ“').isType' henv envIH hΞ“'
case lamDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ B✝ : VExpr hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝ : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝)
case lamDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ B✝ : VExpr hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝ : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) w✝ : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝)
Please generate a tactic in lean4 to solve the state. STATE: case lamDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ B✝ : VExpr hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝ : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .lamDF hu (hB.defeq.sort_r henv hΞ“'.defeq) (ih1 hΞ“) hB ((ih1 hΞ“).defeqDF_l henv hΞ“ hB) (ih2 hΞ“') ((ih1 hΞ“).defeqDF_l henv hΞ“ (ih2 hΞ“'))
case lamDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ B✝ : VExpr hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝ : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) w✝ : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case lamDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ B✝ : VExpr hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝ : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) w✝ : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have hu := hA.sort_r henv hΞ“.defeq
case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝))
case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝))
Please generate a tactic in lean4 to solve the state. STATE: case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have hΞ“' : CtxStrong env U (_::_) := ⟨hΞ“, _, (ih1 hΞ“).hasType.1⟩
case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝))
case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝))
Please generate a tactic in lean4 to solve the state. STATE: case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .forallEDF hu (hb.sort_r henv hΞ“'.defeq) (ih1 hΞ“) (ih2 hΞ“') ((ih1 hΞ“).defeqDF_l henv hΞ“ (ih2 hΞ“'))
case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝))
no goals
Please generate a tactic in lean4 to solve the state. STATE: case forallEDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel hA : IsDefEq env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) hb : IsDefEq env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ih2 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) hΞ“ : CtxStrong env U Ξ“βœ hu : VLevel.WF U u✝ hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ body✝) (VExpr.forallE A'✝ body'✝) (VExpr.sort (VLevel.imax u✝ v✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .defeqDF (hAB.sort_r henv hΞ“.defeq) (ih1 hΞ“) (ih2 hΞ“)
case defeqDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr hAB : IsDefEq env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEq env U Ξ“βœ e1✝ e2✝ A✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ e1✝ e2✝ B✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case defeqDF env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr hAB : IsDefEq env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEq env U Ξ“βœ e1✝ e2✝ A✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ e1✝ e2✝ B✝ TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have he' := ih2 hΞ“
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have ⟨_, hA⟩ := he'.isType' henv envIH hΞ“
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have hΞ“' : CtxStrong env U (_::_) := ⟨hΞ“, _, hA⟩
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have he := ih1 hΞ“'
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have ⟨_, hB⟩ := he.isType' henv envIH hΞ“'
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝¹ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝¹) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ w✝ : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .beta (hA.defeq.sort_r henv hΞ“.defeq) (hB.defeq.sort_r henv hΞ“'.defeq) hA hB he he' (he'.instN henv hΞ“ .zero hB hΞ“) (he'.instN henv hΞ“ .zero he hΞ“)
case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝¹ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝¹) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ w✝ : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) A✝ : VExpr Ξ“βœ : List VExpr e✝ B✝ e'✝ : VExpr a✝¹ : IsDefEq env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝ : IsDefEq env U Ξ“βœ e'✝ e'✝ A✝ ih1 : CtxStrong env U (A✝ :: Ξ“βœ) β†’ IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ hΞ“ : CtxStrong env U Ξ“βœ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ w✝¹ : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort w✝¹) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ w✝ : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (app (lam A✝ e✝) e'✝) (inst e✝ e'✝) (inst B✝ e'✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have he := ih hΞ“
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
let ⟨_, hAB⟩ := he.isType' henv envIH hΞ“
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
let ⟨⟨u, hA⟩, ⟨v, hB⟩⟩ := hAB.forallE_inv' henv envIH hΞ“ (.inl rfl)
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) u : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u) v : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
have hΞ“' : CtxStrong env U (_::_) := ⟨hΞ“, _, hA⟩
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) u : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u) v : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) u : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u) v : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) u : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u) v : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .eta (hA.defeq.sort_r henv hΞ“.defeq) (hB.defeq.sort_r henv hΞ“'.defeq) hA hB (hB.weakN henv (.succ .one)) he (he.weakN henv .one)
case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) u : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u) v : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr e✝ A✝ B✝ : VExpr a✝ : IsDefEq env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) ih : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) hΞ“ : CtxStrong env U Ξ“βœ he : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) w✝ : VLevel hAB : IsDefEqStrong env U Ξ“βœ (VExpr.forallE A✝ B✝) (VExpr.forallE A✝ B✝) (VExpr.sort w✝) u : VLevel hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u) v : VLevel hB : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v) hΞ“' : CtxStrong env U (A✝ :: Ξ“βœ) ⊒ IsDefEqStrong env U Ξ“βœ (lam A✝ (app (lift e✝) (VExpr.bvar 0))) e✝ (VExpr.forallE A✝ B✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .proofIrrel (ih1 hΞ“) (ih2 hΞ“) (ih3 hΞ“)
case proofIrrel env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr p✝ h✝ h'✝ : VExpr a✝² : IsDefEq env U Ξ“βœ p✝ p✝ (VExpr.sort VLevel.zero) a✝¹ : IsDefEq env U Ξ“βœ h✝ h✝ p✝ a✝ : IsDefEq env U Ξ“βœ h'✝ h'✝ p✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ p✝ p✝ (VExpr.sort VLevel.zero) ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ h✝ h✝ p✝ ih3 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ h'✝ h'✝ p✝ hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ h✝ h'✝ p✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case proofIrrel env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) Ξ“βœ : List VExpr p✝ h✝ h'✝ : VExpr a✝² : IsDefEq env U Ξ“βœ p✝ p✝ (VExpr.sort VLevel.zero) a✝¹ : IsDefEq env U Ξ“βœ h✝ h✝ p✝ a✝ : IsDefEq env U Ξ“βœ h'✝ h'✝ p✝ ih1 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ p✝ p✝ (VExpr.sort VLevel.zero) ih2 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ h✝ h✝ p✝ ih3 : CtxStrong env U Ξ“βœ β†’ IsDefEqStrong env U Ξ“βœ h'✝ h'✝ p✝ hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ h✝ h'✝ p✝ TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
let ⟨⟨hl, ⟨_, ht⟩, _⟩, hr, _, _⟩ := envIH.2 h1
case extra env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) df✝ : VDefEq ls✝ : List VLevel Ξ“βœ : List VExpr h1 : env.defeqs df✝ h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : List.length ls✝ = df✝.uvars hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type)
case extra env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) df✝ : VDefEq ls✝ : List VLevel Ξ“βœ : List VExpr h1 : env.defeqs df✝ h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : List.length ls✝ = df✝.uvars hΞ“ : CtxStrong env U Ξ“βœ hl : IsDefEqStrong env df✝.uvars [] df✝.lhs df✝.lhs df✝.type w✝ : VLevel ht : IsDefEqStrong env df✝.uvars [] df✝.type df✝.type (VExpr.sort w✝) right✝¹ : βˆ€ (A B : VExpr), df✝.lhs = VExpr.forallE A B β†’ (βˆƒ u, IsDefEqStrong env df✝.uvars [] A A (VExpr.sort u)) ∧ βˆƒ u, IsDefEqStrong env df✝.uvars [A] B B (VExpr.sort u) hr : IsDefEqStrong env df✝.uvars [] df✝.rhs df✝.rhs df✝.type left✝ : βˆƒ u, IsDefEqStrong env df✝.uvars [] df✝.type df✝.type (VExpr.sort u) right✝ : βˆ€ (A B : VExpr), df✝.rhs = VExpr.forallE A B β†’ (βˆƒ u, IsDefEqStrong env df✝.uvars [] A A (VExpr.sort u)) ∧ βˆƒ u, IsDefEqStrong env df✝.uvars [A] B B (VExpr.sort u) ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type)
Please generate a tactic in lean4 to solve the state. STATE: case extra env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) df✝ : VDefEq ls✝ : List VLevel Ξ“βœ : List VExpr h1 : env.defeqs df✝ h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : List.length ls✝ = df✝.uvars hΞ“ : CtxStrong env U Ξ“βœ ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.strong'
[408, 1]
[465, 88]
exact .extra h1 h2 h3 (.inst h2) (ht.instL h2) (hl.instL h2) (hr.instL h2) ((hl.instL h2).weak0 henv) ((hr.instL h2).weak0 henv)
case extra env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) df✝ : VDefEq ls✝ : List VLevel Ξ“βœ : List VExpr h1 : env.defeqs df✝ h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : List.length ls✝ = df✝.uvars hΞ“ : CtxStrong env U Ξ“βœ hl : IsDefEqStrong env df✝.uvars [] df✝.lhs df✝.lhs df✝.type w✝ : VLevel ht : IsDefEqStrong env df✝.uvars [] df✝.type df✝.type (VExpr.sort w✝) right✝¹ : βˆ€ (A B : VExpr), df✝.lhs = VExpr.forallE A B β†’ (βˆƒ u, IsDefEqStrong env df✝.uvars [] A A (VExpr.sort u)) ∧ βˆƒ u, IsDefEqStrong env df✝.uvars [A] B B (VExpr.sort u) hr : IsDefEqStrong env df✝.uvars [] df✝.rhs df✝.rhs df✝.type left✝ : βˆƒ u, IsDefEqStrong env df✝.uvars [] df✝.type df✝.type (VExpr.sort u) right✝ : βˆ€ (A B : VExpr), df✝.rhs = VExpr.forallE A B β†’ (βˆƒ u, IsDefEqStrong env df✝.uvars [] A A (VExpr.sort u)) ∧ βˆƒ u, IsDefEqStrong env df✝.uvars [A] B B (VExpr.sort u) ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case extra env : VEnv henv : Ordered env envIH : OnTypes env (EnvStrong env) U : Nat Ξ“ : List VExpr e1 e2 A : VExpr hctx : βˆ€ {Ξ“ : List VExpr}, (OnCtx Ξ“ fun Ξ“ A => βˆƒ u, IsDefEqStrong env U Ξ“ A A (VExpr.sort u)) β†’ OnCtx Ξ“ (IsType env U) df✝ : VDefEq ls✝ : List VLevel Ξ“βœ : List VExpr h1 : env.defeqs df✝ h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : List.length ls✝ = df✝.uvars hΞ“ : CtxStrong env U Ξ“βœ hl : IsDefEqStrong env df✝.uvars [] df✝.lhs df✝.lhs df✝.type w✝ : VLevel ht : IsDefEqStrong env df✝.uvars [] df✝.type df✝.type (VExpr.sort w✝) right✝¹ : βˆ€ (A B : VExpr), df✝.lhs = VExpr.forallE A B β†’ (βˆƒ u, IsDefEqStrong env df✝.uvars [] A A (VExpr.sort u)) ∧ βˆƒ u, IsDefEqStrong env df✝.uvars [A] B B (VExpr.sort u) hr : IsDefEqStrong env df✝.uvars [] df✝.rhs df✝.rhs df✝.type left✝ : βˆƒ u, IsDefEqStrong env df✝.uvars [] df✝.type df✝.type (VExpr.sort u) right✝ : βˆ€ (A B : VExpr), df✝.rhs = VExpr.forallE A B β†’ (βˆƒ u, IsDefEqStrong env df✝.uvars [] A A (VExpr.sort u)) ∧ βˆƒ u, IsDefEqStrong env df✝.uvars [A] B B (VExpr.sort u) ⊒ IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.CtxStrong.strong'
[467, 1]
[471, 90]
induction Ξ“ with | nil => trivial | cons _ _ ih => let ⟨hΞ“, _, hA⟩ := hΞ“; exact ⟨ih hΞ“, _, hA.strong' henv envIH (ih hΞ“)⟩
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) hΞ“ : OnCtx Ξ“ (IsType env U) ⊒ CtxStrong env U Ξ“
no goals
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) hΞ“ : OnCtx Ξ“ (IsType env U) ⊒ CtxStrong env U Ξ“ TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.CtxStrong.strong'
[467, 1]
[471, 90]
trivial
case nil env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) hΞ“ : OnCtx [] (IsType env U) ⊒ CtxStrong env U []
no goals
Please generate a tactic in lean4 to solve the state. STATE: case nil env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) hΞ“ : OnCtx [] (IsType env U) ⊒ CtxStrong env U [] TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.CtxStrong.strong'
[467, 1]
[471, 90]
let ⟨hΞ“, _, hA⟩ := hΞ“
case cons env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) head✝ : VExpr tail✝ : List VExpr ih : OnCtx tail✝ (IsType env U) β†’ CtxStrong env U tail✝ hΞ“ : OnCtx (head✝ :: tail✝) (IsType env U) ⊒ CtxStrong env U (head✝ :: tail✝)
case cons env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) head✝ : VExpr tail✝ : List VExpr ih : OnCtx tail✝ (IsType env U) β†’ CtxStrong env U tail✝ hΞ“βœ : OnCtx (head✝ :: tail✝) (IsType env U) hΞ“ : OnCtx tail✝ (IsType env U) w✝ : VLevel hA : HasType env U tail✝ head✝ (sort w✝) ⊒ CtxStrong env U (head✝ :: tail✝)
Please generate a tactic in lean4 to solve the state. STATE: case cons env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) head✝ : VExpr tail✝ : List VExpr ih : OnCtx tail✝ (IsType env U) β†’ CtxStrong env U tail✝ hΞ“ : OnCtx (head✝ :: tail✝) (IsType env U) ⊒ CtxStrong env U (head✝ :: tail✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.CtxStrong.strong'
[467, 1]
[471, 90]
exact ⟨ih hΞ“, _, hA.strong' henv envIH (ih hΞ“)⟩
case cons env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) head✝ : VExpr tail✝ : List VExpr ih : OnCtx tail✝ (IsType env U) β†’ CtxStrong env U tail✝ hΞ“βœ : OnCtx (head✝ :: tail✝) (IsType env U) hΞ“ : OnCtx tail✝ (IsType env U) w✝ : VLevel hA : HasType env U tail✝ head✝ (sort w✝) ⊒ CtxStrong env U (head✝ :: tail✝)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case cons env : VEnv U : Nat henv : Ordered env envIH : OnTypes env (EnvStrong env) head✝ : VExpr tail✝ : List VExpr ih : OnCtx tail✝ (IsType env U) β†’ CtxStrong env U tail✝ hΞ“βœ : OnCtx (head✝ :: tail✝) (IsType env U) hΞ“ : OnCtx tail✝ (IsType env U) w✝ : VLevel hA : HasType env U tail✝ head✝ (sort w✝) ⊒ CtxStrong env U (head✝ :: tail✝) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
have H' := H.strong henv hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V f a : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = app f a ∨ e2 = app f a ⊒ βˆƒ A B, HasType env U Ξ“ f (VExpr.forallE A B) ∧ HasType env U Ξ“ a A
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V f a : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = app f a ∨ e2 = app f a H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ A B, HasType env U Ξ“ f (VExpr.forallE A B) ∧ HasType env U Ξ“ a A
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V f a : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = app f a ∨ e2 = app f a ⊒ βˆƒ A B, HasType env U Ξ“ f (VExpr.forallE A B) ∧ HasType env U Ξ“ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
clear H hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V f a : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = app f a ∨ e2 = app f a H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ A B, HasType env U Ξ“ f (VExpr.forallE A B) ∧ HasType env U Ξ“ a A
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr eq : e1 = app f a ∨ e2 = app f a H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ A B, HasType env U Ξ“ f (VExpr.forallE A B) ∧ HasType env U Ξ“ a A
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V f a : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = app f a ∨ e2 = app f a H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ A B, HasType env U Ξ“ f (VExpr.forallE A B) ∧ HasType env U Ξ“ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ih eq.symm
case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : e✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : e'✝ = app f a ∨ e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : e✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : e'✝ = app f a ∨ e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
obtain eq | eq := eq <;> [exact ih1 (.inl eq); exact ih2 (.inr eq)]
case extra env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr df✝ : VDefEq ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr a✝⁸ : env.defeqs df✝ a✝⁷ : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l a✝⁢ : List.length ls✝ = df✝.uvars a✝⁡ : VLevel.WF U u✝ a✝⁴ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.type) (VExpr.instL ls✝ df✝.type) (VExpr.sort u✝) a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝² : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a_ih✝² : VExpr.instL ls✝ df✝.type = app f a ∨ VExpr.instL ls✝ df✝.type = app f a β†’ βˆƒ A B, HasType env U [] f (VExpr.forallE A B) ∧ HasType env U [] a A a_ih✝¹ : VExpr.instL ls✝ df✝.lhs = app f a ∨ VExpr.instL ls✝ df✝.lhs = app f a β†’ βˆƒ A B, HasType env U [] f (VExpr.forallE A B) ∧ HasType env U [] a A a_ih✝ : VExpr.instL ls✝ df✝.rhs = app f a ∨ VExpr.instL ls✝ df✝.rhs = app f a β†’ βˆƒ A B, HasType env U [] f (VExpr.forallE A B) ∧ HasType env U [] a A ih1 : VExpr.instL ls✝ df✝.lhs = app f a ∨ VExpr.instL ls✝ df✝.lhs = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ih2 : VExpr.instL ls✝ df✝.rhs = app f a ∨ VExpr.instL ls✝ df✝.rhs = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : VExpr.instL ls✝ df✝.lhs = app f a ∨ VExpr.instL ls✝ df✝.rhs = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case extra env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr df✝ : VDefEq ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr a✝⁸ : env.defeqs df✝ a✝⁷ : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l a✝⁢ : List.length ls✝ = df✝.uvars a✝⁡ : VLevel.WF U u✝ a✝⁴ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.type) (VExpr.instL ls✝ df✝.type) (VExpr.sort u✝) a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝² : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a_ih✝² : VExpr.instL ls✝ df✝.type = app f a ∨ VExpr.instL ls✝ df✝.type = app f a β†’ βˆƒ A B, HasType env U [] f (VExpr.forallE A B) ∧ HasType env U [] a A a_ih✝¹ : VExpr.instL ls✝ df✝.lhs = app f a ∨ VExpr.instL ls✝ df✝.lhs = app f a β†’ βˆƒ A B, HasType env U [] f (VExpr.forallE A B) ∧ HasType env U [] a A a_ih✝ : VExpr.instL ls✝ df✝.rhs = app f a ∨ VExpr.instL ls✝ df✝.rhs = app f a β†’ βˆƒ A B, HasType env U [] f (VExpr.forallE A B) ∧ HasType env U [] a A ih1 : VExpr.instL ls✝ df✝.lhs = app f a ∨ VExpr.instL ls✝ df✝.lhs = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ih2 : VExpr.instL ls✝ df✝.rhs = app f a ∨ VExpr.instL ls✝ df✝.rhs = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : VExpr.instL ls✝ df✝.lhs = app f a ∨ VExpr.instL ls✝ df✝.rhs = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
obtain ⟨⟨⟩⟩ | ⟨⟨⟩⟩ := eq
case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁡ a'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) h1 : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) h2 : IsDefEqStrong env U Ξ“βœ a✝⁡ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁡) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : f✝ = app f a ∨ f'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝¹ : a✝⁡ = app f a ∨ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a✝⁡ = app f a ∨ inst B✝ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : app f✝ a✝⁡ = app f a ∨ app f'✝ a'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
case appDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f'✝ a'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A h1 : IsDefEqStrong env U Ξ“βœ f f'✝ (VExpr.forallE A✝ B✝) a_ih✝² : f = app f a ∨ f'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A h2 : IsDefEqStrong env U Ξ“βœ a a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : a = app f a ∨ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a = app f a ∨ inst B✝ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A case appDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ a✝⁡ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A h1 : IsDefEqStrong env U Ξ“βœ f✝ f (VExpr.forallE A✝ B✝) a_ih✝² : f✝ = app f a ∨ f = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A h2 : IsDefEqStrong env U Ξ“βœ a✝⁡ a A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁡) (inst B✝ a) (VExpr.sort v✝) a_ih✝¹ : a✝⁡ = app f a ∨ a = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a✝⁡ = app f a ∨ inst B✝ a = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
Please generate a tactic in lean4 to solve the state. STATE: case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁡ a'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) h1 : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) h2 : IsDefEqStrong env U Ξ“βœ a✝⁡ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁡) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : f✝ = app f a ∨ f'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝¹ : a✝⁡ = app f a ∨ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a✝⁡ = app f a ∨ inst B✝ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : app f✝ a✝⁡ = app f a ∨ app f'✝ a'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ⟨_, _, h1.defeq.hasType.1, h2.defeq.hasType.1⟩
case appDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f'✝ a'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A h1 : IsDefEqStrong env U Ξ“βœ f f'✝ (VExpr.forallE A✝ B✝) a_ih✝² : f = app f a ∨ f'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A h2 : IsDefEqStrong env U Ξ“βœ a a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : a = app f a ∨ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a = app f a ∨ inst B✝ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case appDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f'✝ a'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A h1 : IsDefEqStrong env U Ξ“βœ f f'✝ (VExpr.forallE A✝ B✝) a_ih✝² : f = app f a ∨ f'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A h2 : IsDefEqStrong env U Ξ“βœ a a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : a = app f a ∨ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a = app f a ∨ inst B✝ a'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ⟨_, _, h1.defeq.hasType.2, h2.defeq.hasType.2⟩
case appDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ a✝⁡ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A h1 : IsDefEqStrong env U Ξ“βœ f✝ f (VExpr.forallE A✝ B✝) a_ih✝² : f✝ = app f a ∨ f = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A h2 : IsDefEqStrong env U Ξ“βœ a✝⁡ a A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁡) (inst B✝ a) (VExpr.sort v✝) a_ih✝¹ : a✝⁡ = app f a ∨ a = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a✝⁡ = app f a ∨ inst B✝ a = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case appDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ a✝⁡ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A h1 : IsDefEqStrong env U Ξ“βœ f✝ f (VExpr.forallE A✝ B✝) a_ih✝² : f✝ = app f a ∨ f = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A h2 : IsDefEqStrong env U Ξ“βœ a✝⁡ a A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁡) (inst B✝ a) (VExpr.sort v✝) a_ih✝¹ : a✝⁡ = app f a ∨ a = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a✝⁡ = app f a ∨ inst B✝ a = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ih2 eq
case defeqDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr a✝² : VLevel.WF U u✝ a✝¹ : IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ a_ih✝ : A✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ih2 : e1✝ = app f a ∨ e2✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : e1✝ = app f a ∨ e2✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case defeqDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr a✝² : VLevel.WF U u✝ a✝¹ : IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ a_ih✝ : A✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ih2 : e1✝ = app f a ∨ e2✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : e1✝ = app f a ∨ e2✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
obtain ⟨⟨⟩⟩ | eq := eq
case beta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : e'✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ e'✝ = app f a ∨ inst B✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ e'✝ = app f a ∨ inst e✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : app (lam A✝ e✝) e'✝ = app f a ∨ inst e✝ e'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
case beta.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a_ih✝⁴ : A✝ = app (lam A✝ e✝) a ∨ A✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app (lam A✝ e✝) a ∨ B✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app (lam A✝ e✝) a ∨ e✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A he' : IsDefEqStrong env U Ξ“βœ a a A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ a) (inst B✝ a) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ a) (inst e✝ a) (inst B✝ a) a_ih✝¹ : a = app (lam A✝ e✝) a ∨ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a = app (lam A✝ e✝) a ∨ inst B✝ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ a = app (lam A✝ e✝) a ∨ inst e✝ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : e'✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ e'✝ = app f a ∨ inst B✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ e'✝ = app f a ∨ inst e✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : inst e✝ e'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : e'✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ e'✝ = app f a ∨ inst B✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ e'✝ = app f a ∨ inst e✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : app (lam A✝ e✝) e'✝ = app f a ∨ inst e✝ e'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ⟨_, _, .lam hA.defeq he.defeq, he'.defeq⟩
case beta.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a_ih✝⁴ : A✝ = app (lam A✝ e✝) a ∨ A✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app (lam A✝ e✝) a ∨ B✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app (lam A✝ e✝) a ∨ e✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A he' : IsDefEqStrong env U Ξ“βœ a a A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ a) (inst B✝ a) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ a) (inst e✝ a) (inst B✝ a) a_ih✝¹ : a = app (lam A✝ e✝) a ∨ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a = app (lam A✝ e✝) a ∨ inst B✝ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ a = app (lam A✝ e✝) a ∨ inst e✝ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case beta.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a_ih✝⁴ : A✝ = app (lam A✝ e✝) a ∨ A✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app (lam A✝ e✝) a ∨ B✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app (lam A✝ e✝) a ∨ e✝ = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A he' : IsDefEqStrong env U Ξ“βœ a a A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ a) (inst B✝ a) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ a) (inst e✝ a) (inst B✝ a) a_ih✝¹ : a = app (lam A✝ e✝) a ∨ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ a = app (lam A✝ e✝) a ∨ inst B✝ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ a = app (lam A✝ e✝) a ∨ inst e✝ a = app (lam A✝ e✝) a β†’ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ⊒ βˆƒ A B, HasType env U Ξ“βœ (lam A✝ e✝) (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ihee (.inl eq)
case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : e'✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ e'✝ = app f a ∨ inst B✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ e'✝ = app f a ∨ inst e✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : inst e✝ e'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) he : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ he' : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝³ : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝² : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : e'✝ = app f a ∨ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : inst B✝ e'✝ = app f a ∨ inst B✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A ihee : inst e✝ e'✝ = app f a ∨ inst e✝ e'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A eq : inst e✝ e'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
obtain ⟨⟨⟩⟩ | eq := eq
case eta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝² : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : liftN 1 B✝ 1 = app f a ∨ liftN 1 B✝ 1 = app f a β†’ βˆƒ A B, HasType env U (lift A✝ :: A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (lift A✝ :: A✝ :: Ξ“βœ) a A ih : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : lift e✝ = app f a ∨ lift e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A eq : lam A✝ (app (lift e✝) (VExpr.bvar 0)) = app f a ∨ e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝² : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : liftN 1 B✝ 1 = app f a ∨ liftN 1 B✝ 1 = app f a β†’ βˆƒ A B, HasType env U (lift A✝ :: A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (lift A✝ :: A✝ :: Ξ“βœ) a A ih : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : lift e✝ = app f a ∨ lift e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A eq : e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝² : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : liftN 1 B✝ 1 = app f a ∨ liftN 1 B✝ 1 = app f a β†’ βˆƒ A B, HasType env U (lift A✝ :: A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (lift A✝ :: A✝ :: Ξ“βœ) a A ih : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : lift e✝ = app f a ∨ lift e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A eq : lam A✝ (app (lift e✝) (VExpr.bvar 0)) = app f a ∨ e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
exact ih (.inl eq)
case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝² : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : liftN 1 B✝ 1 = app f a ∨ liftN 1 B✝ 1 = app f a β†’ βˆƒ A B, HasType env U (lift A✝ :: A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (lift A✝ :: A✝ :: Ξ“βœ) a A ih : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : lift e✝ = app f a ∨ lift e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A eq : e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = app f a ∨ A✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝² : B✝ = app f a ∨ B✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝¹ : liftN 1 B✝ 1 = app f a ∨ liftN 1 B✝ 1 = app f a β†’ βˆƒ A B, HasType env U (lift A✝ :: A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (lift A✝ :: A✝ :: Ξ“βœ) a A ih : e✝ = app f a ∨ e✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝ : lift e✝ = app f a ∨ lift e✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A eq : e✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.app_inv'
[489, 1]
[511, 20]
nomatch eq
case forallEDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a_ih✝² : A✝ = app f a ∨ A'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝¹ : body✝ = app f a ∨ body'✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝ : body✝ = app f a ∨ body'✝ = app f a β†’ βˆƒ A B, HasType env U (A'✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A'✝ :: Ξ“βœ) a A eq : VExpr.forallE A✝ body✝ = app f a ∨ VExpr.forallE A'✝ body'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A
no goals
Please generate a tactic in lean4 to solve the state. STATE: case forallEDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V f a : VExpr Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a_ih✝² : A✝ = app f a ∨ A'✝ = app f a β†’ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A a_ih✝¹ : body✝ = app f a ∨ body'✝ = app f a β†’ βˆƒ A B, HasType env U (A✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A✝ :: Ξ“βœ) a A a_ih✝ : body✝ = app f a ∨ body'✝ = app f a β†’ βˆƒ A B, HasType env U (A'✝ :: Ξ“βœ) f (VExpr.forallE A B) ∧ HasType env U (A'✝ :: Ξ“βœ) a A eq : VExpr.forallE A✝ body✝ = app f a ∨ VExpr.forallE A'✝ body'✝ = app f a ⊒ βˆƒ A B, HasType env U Ξ“βœ f (VExpr.forallE A B) ∧ HasType env U Ξ“βœ a A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
have H' := H.strong henv hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V A body : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = lam A body ∨ e2 = lam A body ⊒ IsType env U Ξ“ A ∧ WF env U (A :: Ξ“) body
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V A body : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = lam A body ∨ e2 = lam A body H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ IsType env U Ξ“ A ∧ WF env U (A :: Ξ“) body
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V A body : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = lam A body ∨ e2 = lam A body ⊒ IsType env U Ξ“ A ∧ WF env U (A :: Ξ“) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
clear H hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V A body : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = lam A body ∨ e2 = lam A body H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ IsType env U Ξ“ A ∧ WF env U (A :: Ξ“) body
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr eq : e1 = lam A body ∨ e2 = lam A body H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ IsType env U Ξ“ A ∧ WF env U (A :: Ξ“) body
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V A body : VExpr H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = lam A body ∨ e2 = lam A body H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ IsType env U Ξ“ A ∧ WF env U (A :: Ξ“) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ih eq.symm
case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : e✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : e'✝ = lam A body ∨ e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : e✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : e'✝ = lam A body ∨ e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
obtain eq | eq := eq <;> [exact ih1 (.inl eq); exact ih2 (.inr eq)]
case extra env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr df✝ : VDefEq ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr a✝⁸ : env.defeqs df✝ a✝⁷ : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l a✝⁢ : List.length ls✝ = df✝.uvars a✝⁡ : VLevel.WF U u✝ a✝⁴ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.type) (VExpr.instL ls✝ df✝.type) (VExpr.sort u✝) a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝² : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a_ih✝² : VExpr.instL ls✝ df✝.type = lam A body ∨ VExpr.instL ls✝ df✝.type = lam A body β†’ IsType env U [] A ∧ WF env U [A] body a_ih✝¹ : VExpr.instL ls✝ df✝.lhs = lam A body ∨ VExpr.instL ls✝ df✝.lhs = lam A body β†’ IsType env U [] A ∧ WF env U [A] body a_ih✝ : VExpr.instL ls✝ df✝.rhs = lam A body ∨ VExpr.instL ls✝ df✝.rhs = lam A body β†’ IsType env U [] A ∧ WF env U [A] body ih1 : VExpr.instL ls✝ df✝.lhs = lam A body ∨ VExpr.instL ls✝ df✝.lhs = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ih2 : VExpr.instL ls✝ df✝.rhs = lam A body ∨ VExpr.instL ls✝ df✝.rhs = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : VExpr.instL ls✝ df✝.lhs = lam A body ∨ VExpr.instL ls✝ df✝.rhs = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case extra env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr df✝ : VDefEq ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr a✝⁸ : env.defeqs df✝ a✝⁷ : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l a✝⁢ : List.length ls✝ = df✝.uvars a✝⁡ : VLevel.WF U u✝ a✝⁴ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.type) (VExpr.instL ls✝ df✝.type) (VExpr.sort u✝) a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝² : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a_ih✝² : VExpr.instL ls✝ df✝.type = lam A body ∨ VExpr.instL ls✝ df✝.type = lam A body β†’ IsType env U [] A ∧ WF env U [A] body a_ih✝¹ : VExpr.instL ls✝ df✝.lhs = lam A body ∨ VExpr.instL ls✝ df✝.lhs = lam A body β†’ IsType env U [] A ∧ WF env U [A] body a_ih✝ : VExpr.instL ls✝ df✝.rhs = lam A body ∨ VExpr.instL ls✝ df✝.rhs = lam A body β†’ IsType env U [] A ∧ WF env U [A] body ih1 : VExpr.instL ls✝ df✝.lhs = lam A body ∨ VExpr.instL ls✝ df✝.lhs = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ih2 : VExpr.instL ls✝ df✝.rhs = lam A body ∨ VExpr.instL ls✝ df✝.rhs = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : VExpr.instL ls✝ df✝.lhs = lam A body ∨ VExpr.instL ls✝ df✝.rhs = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
obtain ⟨⟨⟩⟩ | ⟨⟨⟩⟩ := eq
case lamDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ body'✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ h1 : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) h4 : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ h5 : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ a_ih✝⁴ : A✝ = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body a_ih✝¹ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body eq : lam A✝ body✝ = lam A body ∨ lam A'✝ body'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
case lamDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body'✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ a✝¹ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body h1 : IsDefEqStrong env U Ξ“βœ A A'✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝³ : A = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body h5 : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body body'✝ B✝ a_ih✝¹ : body = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body h4 : IsDefEqStrong env U (A :: Ξ“βœ) body body'✝ B✝ a_ih✝ : body = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body case lamDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body h1 : IsDefEqStrong env U Ξ“βœ A✝ A (VExpr.sort u✝) a✝ : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝³ : A✝ = lam A body ∨ A = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body h4 : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body B✝ a_ih✝¹ : body✝ = lam A body ∨ body = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body h5 : IsDefEqStrong env U (A :: Ξ“βœ) body✝ body B✝ a_ih✝ : body✝ = lam A body ∨ body = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
Please generate a tactic in lean4 to solve the state. STATE: case lamDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ body'✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ h1 : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) h4 : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ h5 : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ a_ih✝⁴ : A✝ = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body a_ih✝¹ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body eq : lam A✝ body✝ = lam A body ∨ lam A'✝ body'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ⟨⟨_, h1.defeq.hasType.1⟩, _, h4.defeq.hasType.1⟩
case lamDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body'✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ a✝¹ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body h1 : IsDefEqStrong env U Ξ“βœ A A'✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝³ : A = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body h5 : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body body'✝ B✝ a_ih✝¹ : body = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body h4 : IsDefEqStrong env U (A :: Ξ“βœ) body body'✝ B✝ a_ih✝ : body = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case lamDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body'✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ a✝¹ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body h1 : IsDefEqStrong env U Ξ“βœ A A'✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝³ : A = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body h5 : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body body'✝ B✝ a_ih✝¹ : body = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body h4 : IsDefEqStrong env U (A :: Ξ“βœ) body body'✝ B✝ a_ih✝ : body = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ⟨⟨_, h1.defeq.hasType.2⟩, _, h5.defeq.hasType.2⟩
case lamDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body h1 : IsDefEqStrong env U Ξ“βœ A✝ A (VExpr.sort u✝) a✝ : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝³ : A✝ = lam A body ∨ A = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body h4 : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body B✝ a_ih✝¹ : body✝ = lam A body ∨ body = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body h5 : IsDefEqStrong env U (A :: Ξ“βœ) body✝ body B✝ a_ih✝ : body✝ = lam A body ∨ body = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case lamDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ : VExpr a✝³ : VLevel.WF U u✝ a✝² : VLevel.WF U v✝ a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝⁴ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body h1 : IsDefEqStrong env U Ξ“βœ A✝ A (VExpr.sort u✝) a✝ : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝³ : A✝ = lam A body ∨ A = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body h4 : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body B✝ a_ih✝¹ : body✝ = lam A body ∨ body = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body h5 : IsDefEqStrong env U (A :: Ξ“βœ) body✝ body B✝ a_ih✝ : body✝ = lam A body ∨ body = lam A body β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ih2 eq
case defeqDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr a✝² : VLevel.WF U u✝ a✝¹ : IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ a_ih✝ : A✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ih2 : e1✝ = lam A body ∨ e2✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : e1✝ = lam A body ∨ e2✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case defeqDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr a✝² : VLevel.WF U u✝ a✝¹ : IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ a_ih✝ : A✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ih2 : e1✝ = lam A body ∨ e2✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : e1✝ = lam A body ∨ e2✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
obtain ⟨⟨⟩⟩ | eq := eq
case beta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : e'✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : inst B✝ e'✝ = lam A body ∨ inst B✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ihee : inst e✝ e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : app (lam A✝ e✝) e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : e'✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : inst B✝ e'✝ = lam A body ∨ inst B✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ihee : inst e✝ e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : inst e✝ e'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : e'✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : inst B✝ e'✝ = lam A body ∨ inst B✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ihee : inst e✝ e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : app (lam A✝ e✝) e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ihee (.inl eq)
case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : e'✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : inst B✝ e'✝ = lam A body ∨ inst B✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ihee : inst e✝ e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : inst e✝ e'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝³ : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝² : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : e'✝ = lam A body ∨ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : inst B✝ e'✝ = lam A body ∨ inst B✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body ihee : inst e✝ e'✝ = lam A body ∨ inst e✝ e'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body eq : inst e✝ e'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
obtain ⟨⟨⟩⟩ | eq := eq
case eta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) he' : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : liftN 1 B✝ 1 = lam A body ∨ liftN 1 B✝ 1 = lam A body β†’ IsType env U (lift A✝ :: A✝ :: Ξ“βœ) A ∧ WF env U (A :: lift A✝ :: A✝ :: Ξ“βœ) body ih : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : lift e✝ = lam A body ∨ lift e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body eq : lam A✝ (app (lift e✝) (VExpr.bvar 0)) = lam A body ∨ e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
case eta.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A : VExpr Ξ“βœ : List VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A A (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A :: A :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A B✝) he' : IsDefEqStrong env U (A :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A) (liftN 1 B✝ 1)) ih : e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝³ : A = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ A = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝² : B✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ B✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝¹ : liftN 1 B✝ 1 = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ liftN 1 B✝ 1 = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (lift A :: A :: Ξ“βœ) A ∧ WF env U (A :: lift A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝ : lift e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ lift e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) he' : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : liftN 1 B✝ 1 = lam A body ∨ liftN 1 B✝ 1 = lam A body β†’ IsType env U (lift A✝ :: A✝ :: Ξ“βœ) A ∧ WF env U (A :: lift A✝ :: A✝ :: Ξ“βœ) body ih : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : lift e✝ = lam A body ∨ lift e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body eq : e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) he' : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : liftN 1 B✝ 1 = lam A body ∨ liftN 1 B✝ 1 = lam A body β†’ IsType env U (lift A✝ :: A✝ :: Ξ“βœ) A ∧ WF env U (A :: lift A✝ :: A✝ :: Ξ“βœ) body ih : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : lift e✝ = lam A body ∨ lift e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body eq : lam A✝ (app (lift e✝) (VExpr.bvar 0)) = lam A body ∨ e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ⟨⟨_, hA.defeq.hasType.1⟩, _, he'.defeq.hasType.1.app (.bvar .zero)⟩
case eta.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A : VExpr Ξ“βœ : List VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A A (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A :: A :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A B✝) he' : IsDefEqStrong env U (A :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A) (liftN 1 B✝ 1)) ih : e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝³ : A = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ A = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝² : B✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ B✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝¹ : liftN 1 B✝ 1 = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ liftN 1 B✝ 1 = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (lift A :: A :: Ξ“βœ) A ∧ WF env U (A :: lift A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝ : lift e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ lift e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0))
no goals
Please generate a tactic in lean4 to solve the state. STATE: case eta.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A : VExpr Ξ“βœ : List VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A A (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A :: A :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A B✝) he' : IsDefEqStrong env U (A :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A) (liftN 1 B✝ 1)) ih : e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝³ : A = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ A = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝² : B✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ B✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝¹ : liftN 1 B✝ 1 = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ liftN 1 B✝ 1 = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (lift A :: A :: Ξ“βœ) A ∧ WF env U (A :: lift A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) a_ih✝ : lift e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) ∨ lift e✝ = lam A (app (lift e✝) (VExpr.bvar 0)) β†’ IsType env U (A :: Ξ“βœ) A ∧ WF env U (A :: A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) (app (lift e✝) (VExpr.bvar 0)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
exact ih (.inl eq)
case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) he' : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : liftN 1 B✝ 1 = lam A body ∨ liftN 1 B✝ 1 = lam A body β†’ IsType env U (lift A✝ :: A✝ :: Ξ“βœ) A ∧ WF env U (A :: lift A✝ :: A✝ :: Ξ“βœ) body ih : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : lift e✝ = lam A body ∨ lift e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body eq : e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ hA : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝² : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) he' : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = lam A body ∨ A✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝² : B✝ = lam A body ∨ B✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝¹ : liftN 1 B✝ 1 = lam A body ∨ liftN 1 B✝ 1 = lam A body β†’ IsType env U (lift A✝ :: A✝ :: Ξ“βœ) A ∧ WF env U (A :: lift A✝ :: A✝ :: Ξ“βœ) body ih : e✝ = lam A body ∨ e✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝ : lift e✝ = lam A body ∨ lift e✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body eq : e✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.lam_inv'
[524, 1]
[546, 20]
nomatch eq
case forallEDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a_ih✝² : A✝ = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝¹ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body eq : VExpr.forallE A✝ body✝ = lam A body ∨ VExpr.forallE A'✝ body'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body
no goals
Please generate a tactic in lean4 to solve the state. STATE: case forallEDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V A body : VExpr Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a_ih✝² : A✝ = lam A body ∨ A'✝ = lam A body β†’ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body a_ih✝¹ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A✝ :: Ξ“βœ) A ∧ WF env U (A :: A✝ :: Ξ“βœ) body a_ih✝ : body✝ = lam A body ∨ body'✝ = lam A body β†’ IsType env U (A'✝ :: Ξ“βœ) A ∧ WF env U (A :: A'✝ :: Ξ“βœ) body eq : VExpr.forallE A✝ body✝ = lam A body ∨ VExpr.forallE A'✝ body'✝ = lam A body ⊒ IsType env U Ξ“βœ A ∧ WF env U (A :: Ξ“βœ) body TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
have H' := H.strong henv hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V : VExpr c : Name ls : List VLevel H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = VExpr.const c ls ∨ e2 = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V : VExpr c : Name ls : List VLevel H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = VExpr.const c ls ∨ e2 = VExpr.const c ls H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V : VExpr c : Name ls : List VLevel H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = VExpr.const c ls ∨ e2 = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
clear H hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V : VExpr c : Name ls : List VLevel H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = VExpr.const c ls ∨ e2 = VExpr.const c ls H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel eq : e1 = VExpr.const c ls ∨ e2 = VExpr.const c ls H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 V : VExpr c : Name ls : List VLevel H : IsDefEq env U Ξ“ e1 e2 V eq : e1 = VExpr.const c ls ∨ e2 = VExpr.const c ls H' : IsDefEqStrong env U Ξ“ e1 e2 V ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
exact ih eq.symm
case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : e✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e'✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : e✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e'✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
obtain eq | eq := eq <;> [exact ih1 (.inl eq); exact ih2 (.inr eq)]
case extra env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel df✝ : VDefEq ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr a✝⁸ : env.defeqs df✝ a✝⁷ : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l a✝⁢ : List.length ls✝ = df✝.uvars a✝⁡ : VLevel.WF U u✝ a✝⁴ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.type) (VExpr.instL ls✝ df✝.type) (VExpr.sort u✝) a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝² : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a_ih✝² : VExpr.instL ls✝ df✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : VExpr.instL ls✝ df✝.lhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.lhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : VExpr.instL ls✝ df✝.rhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.rhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih1 : VExpr.instL ls✝ df✝.lhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.lhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih2 : VExpr.instL ls✝ df✝.rhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.rhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : VExpr.instL ls✝ df✝.lhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.rhs = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case extra env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel df✝ : VDefEq ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr a✝⁸ : env.defeqs df✝ a✝⁷ : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l a✝⁢ : List.length ls✝ = df✝.uvars a✝⁡ : VLevel.WF U u✝ a✝⁴ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.type) (VExpr.instL ls✝ df✝.type) (VExpr.sort u✝) a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝² : IsDefEqStrong env U [] (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.lhs) (VExpr.instL ls✝ df✝.type) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.rhs) (VExpr.instL ls✝ df✝.type) a_ih✝² : VExpr.instL ls✝ df✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : VExpr.instL ls✝ df✝.lhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.lhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : VExpr.instL ls✝ df✝.rhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.rhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih1 : VExpr.instL ls✝ df✝.lhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.lhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih2 : VExpr.instL ls✝ df✝.rhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.rhs = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : VExpr.instL ls✝ df✝.lhs = VExpr.const c ls ∨ VExpr.instL ls✝ df✝.rhs = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
obtain ⟨⟨⟩⟩ | ⟨⟨⟩⟩ := eq
case constDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel c✝ : Name ci✝ : VConstant ls✝ ls'✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h1 : env.constants c✝ = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : βˆ€ (l : VLevel), l ∈ ls'✝ β†’ VLevel.WF U l h4 : List.length ls✝ = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls✝ ls'✝ a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U [] (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : VExpr.const c✝ ls✝ = VExpr.const c ls ∨ VExpr.const c✝ ls'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
case constDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel ci✝ : VConstant ls'✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h3 : βˆ€ (l : VLevel), l ∈ ls'✝ β†’ VLevel.WF U l a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ a_ih✝² : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars h1 : env.constants c = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l h4 : List.length ls = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls ls'✝ a✝¹ : IsDefEqStrong env U [] (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a_ih✝¹ a_ih✝ : VExpr.instL ls ci✝.type = VExpr.const c ls ∨ VExpr.instL ls ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars case constDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel ci✝ : VConstant ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h4 : List.length ls✝ = ci✝.uvars a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ a_ih✝² : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars h1 : env.constants c = some (some ci✝) h3 : βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls✝ ls a✝¹ : IsDefEqStrong env U [] (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a_ih✝¹ a_ih✝ : VExpr.instL ls ci✝.type = VExpr.const c ls ∨ VExpr.instL ls ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
Please generate a tactic in lean4 to solve the state. STATE: case constDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel c✝ : Name ci✝ : VConstant ls✝ ls'✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h1 : env.constants c✝ = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h3 : βˆ€ (l : VLevel), l ∈ ls'✝ β†’ VLevel.WF U l h4 : List.length ls✝ = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls✝ ls'✝ a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U [] (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : VExpr.const c✝ ls✝ = VExpr.const c ls ∨ VExpr.const c✝ ls'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
exact ⟨_, h1, h2, h4⟩
case constDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel ci✝ : VConstant ls'✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h3 : βˆ€ (l : VLevel), l ∈ ls'✝ β†’ VLevel.WF U l a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ a_ih✝² : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars h1 : env.constants c = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l h4 : List.length ls = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls ls'✝ a✝¹ : IsDefEqStrong env U [] (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a_ih✝¹ a_ih✝ : VExpr.instL ls ci✝.type = VExpr.const c ls ∨ VExpr.instL ls ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case constDF.inl.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel ci✝ : VConstant ls'✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h3 : βˆ€ (l : VLevel), l ∈ ls'✝ β†’ VLevel.WF U l a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls'✝ ci✝.type) (VExpr.instL ls'✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ a_ih✝² : VExpr.instL ls'✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls'✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars h1 : env.constants c = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l h4 : List.length ls = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls ls'✝ a✝¹ : IsDefEqStrong env U [] (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a_ih✝¹ a_ih✝ : VExpr.instL ls ci✝.type = VExpr.const c ls ∨ VExpr.instL ls ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
exact ⟨_, h1, h3, h5.length_eq.symm.trans h4⟩
case constDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel ci✝ : VConstant ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h4 : List.length ls✝ = ci✝.uvars a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ a_ih✝² : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars h1 : env.constants c = some (some ci✝) h3 : βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls✝ ls a✝¹ : IsDefEqStrong env U [] (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a_ih✝¹ a_ih✝ : VExpr.instL ls ci✝.type = VExpr.const c ls ∨ VExpr.instL ls ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case constDF.inr.refl env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel ci✝ : VConstant ls✝ : List VLevel u✝ : VLevel Ξ“βœ : List VExpr h2 : βˆ€ (l : VLevel), l ∈ ls✝ β†’ VLevel.WF U l h4 : List.length ls✝ = ci✝.uvars a✝⁴ : VLevel.WF U u✝ a✝³ : IsDefEqStrong env U [] (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a✝² : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls✝ ci✝.type) (VExpr.instL ls✝ ci✝.type) (VExpr.sort u✝) a_ih✝³ a_ih✝² : VExpr.instL ls✝ ci✝.type = VExpr.const c ls ∨ VExpr.instL ls✝ ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars h1 : env.constants c = some (some ci✝) h3 : βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls✝ ls a✝¹ : IsDefEqStrong env U [] (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls ci✝.type) (VExpr.instL ls ci✝.type) (VExpr.sort u✝) a_ih✝¹ a_ih✝ : VExpr.instL ls ci✝.type = VExpr.const c ls ∨ VExpr.instL ls ci✝.type = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
exact ih2 eq
case defeqDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr a✝² : VLevel.WF U u✝ a✝¹ : IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ a_ih✝ : A✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih2 : e1✝ = VExpr.const c ls ∨ e2✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e1✝ = VExpr.const c ls ∨ e2✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case defeqDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ B✝ : VExpr u✝ : VLevel e1✝ e2✝ : VExpr a✝² : VLevel.WF U u✝ a✝¹ : IsDefEqStrong env U Ξ“βœ A✝ B✝ (VExpr.sort u✝) a✝ : IsDefEqStrong env U Ξ“βœ e1✝ e2✝ A✝ a_ih✝ : A✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih2 : e1✝ = VExpr.const c ls ∨ e2✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e1✝ = VExpr.const c ls ∨ e2✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
obtain ⟨⟨⟩⟩ | eq := eq
case beta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝³ : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : e'✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : inst B✝ e'✝ = VExpr.const c ls ∨ inst B✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ihee : inst e✝ e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : app (lam A✝ e✝) e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝³ : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : e'✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : inst B✝ e'✝ = VExpr.const c ls ∨ inst B✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ihee : inst e✝ e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : inst e✝ e'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
Please generate a tactic in lean4 to solve the state. STATE: case beta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝³ : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : e'✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : inst B✝ e'✝ = VExpr.const c ls ∨ inst B✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ihee : inst e✝ e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : app (lam A✝ e✝) e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
exact ihee (.inl eq)
case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝³ : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : e'✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : inst B✝ e'✝ = VExpr.const c ls ∨ inst B✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ihee : inst e✝ e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : inst e✝ e'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case beta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ e'✝ : VExpr a✝⁷ : VLevel.WF U u✝ a✝⁢ : VLevel.WF U v✝ a✝⁡ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝⁴ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) e✝ e✝ B✝ a✝² : IsDefEqStrong env U Ξ“βœ e'✝ e'✝ A✝ a✝¹ : IsDefEqStrong env U Ξ“βœ (inst B✝ e'✝) (inst B✝ e'✝) (VExpr.sort v✝) a✝ : IsDefEqStrong env U Ξ“βœ (inst e✝ e'✝) (inst e✝ e'✝) (inst B✝ e'✝) a_ih✝⁴ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝³ : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : e'✝ = VExpr.const c ls ∨ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : inst B✝ e'✝ = VExpr.const c ls ∨ inst B✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ihee : inst e✝ e'✝ = VExpr.const c ls ∨ inst e✝ e'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : inst e✝ e'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
obtain ⟨⟨⟩⟩ | eq := eq
case eta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : liftN 1 B✝ 1 = VExpr.const c ls ∨ liftN 1 B✝ 1 = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : lift e✝ = VExpr.const c ls ∨ lift e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : lam A✝ (app (lift e✝) (VExpr.bvar 0)) = VExpr.const c ls ∨ e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : liftN 1 B✝ 1 = VExpr.const c ls ∨ liftN 1 B✝ 1 = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : lift e✝ = VExpr.const c ls ∨ lift e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
Please generate a tactic in lean4 to solve the state. STATE: case eta env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : liftN 1 B✝ 1 = VExpr.const c ls ∨ liftN 1 B✝ 1 = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : lift e✝ = VExpr.const c ls ∨ lift e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : lam A✝ (app (lift e✝) (VExpr.bvar 0)) = VExpr.const c ls ∨ e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
exact ih (.inl eq)
case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : liftN 1 B✝ 1 = VExpr.const c ls ∨ liftN 1 B✝ 1 = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : lift e✝ = VExpr.const c ls ∨ lift e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case eta.inr env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel e✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (lift A✝ :: A✝ :: Ξ“βœ) (liftN 1 B✝ 1) (liftN 1 B✝ 1) (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U Ξ“βœ e✝ e✝ (VExpr.forallE A✝ B✝) a✝ : IsDefEqStrong env U (A✝ :: Ξ“βœ) (lift e✝) (lift e✝) (VExpr.forallE (lift A✝) (liftN 1 B✝ 1)) a_ih✝³ : A✝ = VExpr.const c ls ∨ A✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝² : B✝ = VExpr.const c ls ∨ B✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ : liftN 1 B✝ 1 = VExpr.const c ls ∨ liftN 1 B✝ 1 = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars ih : e✝ = VExpr.const c ls ∨ e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝ : lift e✝ = VExpr.const c ls ∨ lift e✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : e✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Strong.lean
Lean4Lean.VEnv.IsDefEq.const_inv'
[559, 1]
[580, 20]
nomatch eq
case forallEDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a_ih✝² : A✝ = VExpr.const c ls ∨ A'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ a_ih✝ : body✝ = VExpr.const c ls ∨ body'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : VExpr.forallE A✝ body✝ = VExpr.const c ls ∨ VExpr.forallE A'✝ body'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars
no goals
Please generate a tactic in lean4 to solve the state. STATE: case forallEDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 V : VExpr c : Name ls : List VLevel Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel body✝ body'✝ : VExpr v✝ : VLevel a✝⁴ : VLevel.WF U u✝ a✝³ : VLevel.WF U v✝ a✝² : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ (VExpr.sort v✝) a_ih✝² : A✝ = VExpr.const c ls ∨ A'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars a_ih✝¹ a_ih✝ : body✝ = VExpr.const c ls ∨ body'✝ = VExpr.const c ls β†’ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars eq : VExpr.forallE A✝ body✝ = VExpr.const c ls ∨ VExpr.forallE A'✝ body'✝ = VExpr.const c ls ⊒ βˆƒ ci, env.constants c = some (some ci) ∧ (βˆ€ (l : VLevel), l ∈ ls β†’ VLevel.WF U l) ∧ List.length ls = ci.uvars TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
refine with_addConst (cis := [.const _ eqConst]) (hcis := ⟨hq, ⟨⟩⟩) henv (fun _ => ⟨_, by type_tac⟩) fun henv => ?_
env env' : VEnv henv : Ordered env hq : QuotReady env ⊒ addQuot env = some env' β†’ Ordered env'
env env' : VEnv henv✝ : Ordered env hq : QuotReady env env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env'
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv : Ordered env hq : QuotReady env ⊒ addQuot env = some env' β†’ Ordered env' TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
refine with_addConst henv (fun ⟨quot, _⟩ => ⟨_, by type_tac⟩) fun henv => ?_
env env' : VEnv henv✝ : Ordered env hq : QuotReady env env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env'
env env' : VEnv henv✝¹ : Ordered env hq : QuotReady env env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env'
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝ : Ordered env hq : QuotReady env env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env' TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
refine with_addConst henv (fun ⟨_, quot, _⟩ => ⟨_, by type_tac⟩) fun henv => ?_
env env' : VEnv henv✝¹ : Ordered env hq : QuotReady env env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env'
env env' : VEnv henv✝² : Ordered env hq : QuotReady env env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env'
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝¹ : Ordered env hq : QuotReady env env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env' TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
refine with_addConst henv (fun ⟨_, _, quot, eq, _⟩ => ⟨_, by type_tac⟩) fun henv => ?_
env env' : VEnv henv✝² : Ordered env hq : QuotReady env env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env'
env env' : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ some (addDefEq env1✝ quotDefEq) = some env' β†’ Ordered env'
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝² : Ordered env hq : QuotReady env env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ (do let env ← addConst env1✝ `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' β†’ Ordered env' TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
rintro ⟨_, _, _, _, eq, _⟩ ⟨⟩
env env' : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ some (addDefEq env1✝ quotDefEq) = some env' β†’ Ordered env'
case intro.intro.intro.intro.intro.refl env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ Ordered (addDefEq env1✝ quotDefEq)
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ ⊒ HasObjects env1✝ [VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] β†’ some (addDefEq env1✝ quotDefEq) = some env' β†’ Ordered env' TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
exact .defeq henv ⟨by type_tac, by type_tac⟩
case intro.intro.intro.intro.intro.refl env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ Ordered (addDefEq env1✝ quotDefEq)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.refl env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ Ordered (addDefEq env1✝ quotDefEq) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
type_tac
env env' : VEnv henv : Ordered env hq : QuotReady env x✝ : HasObjects env [VObject.const `Eq (some eqConst)] ⊒ HasType env quotConst.uvars [] quotConst.type (VExpr.sort (?m.204 x✝))
no goals
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv : Ordered env hq : QuotReady env x✝ : HasObjects env [VObject.const `Eq (some eqConst)] ⊒ HasType env quotConst.uvars [] quotConst.type (VExpr.sort (?m.204 x✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
type_tac
env env' : VEnv henv✝ : Ordered env hq : QuotReady env env1✝ : VEnv henv : Ordered env1✝ x✝ : HasObjects env1✝ [VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] quot : env1✝.constants `Quot = some (some quotConst) right✝ : HasObjects env1✝ [VObject.const `Eq (some eqConst)] ⊒ HasType env1✝ quotMkConst.uvars [] quotMkConst.type (VExpr.sort (?m.743 x✝ quot right✝))
no goals
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝ : Ordered env hq : QuotReady env env1✝ : VEnv henv : Ordered env1✝ x✝ : HasObjects env1✝ [VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] quot : env1✝.constants `Quot = some (some quotConst) right✝ : HasObjects env1✝ [VObject.const `Eq (some eqConst)] ⊒ HasType env1✝ quotMkConst.uvars [] quotMkConst.type (VExpr.sort (?m.743 x✝ quot right✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
type_tac
env env' : VEnv henv✝¹ : Ordered env hq : QuotReady env env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ x✝ : HasObjects env1✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] left✝ : env1✝.constants `Quot.mk = some (some quotMkConst) quot : env1✝.constants `Quot = some (some quotConst) right✝ : HasObjects env1✝ [VObject.const `Eq (some eqConst)] ⊒ HasType env1✝ quotIndConst.uvars [] quotIndConst.type (VExpr.sort (?m.2200 x✝ left✝ quot right✝))
no goals
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝¹ : Ordered env hq : QuotReady env env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ x✝ : HasObjects env1✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] left✝ : env1✝.constants `Quot.mk = some (some quotMkConst) quot : env1✝.constants `Quot = some (some quotConst) right✝ : HasObjects env1✝ [VObject.const `Eq (some eqConst)] ⊒ HasType env1✝ quotIndConst.uvars [] quotIndConst.type (VExpr.sort (?m.2200 x✝ left✝ quot right✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
type_tac
env env' : VEnv henv✝² : Ordered env hq : QuotReady env env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ x✝ : HasObjects env1✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] left✝¹ : env1✝.constants `Quot.ind = some (some quotIndConst) left✝ : env1✝.constants `Quot.mk = some (some quotMkConst) quot : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ HasType env1✝ quotLiftConst.uvars [] quotLiftConst.type (VExpr.sort (?m.5951 x✝ left✝¹ left✝ quot eq right✝))
no goals
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv✝² : Ordered env hq : QuotReady env env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ x✝ : HasObjects env1✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst), VObject.const `Eq (some eqConst)] left✝¹ : env1✝.constants `Quot.ind = some (some quotIndConst) left✝ : env1✝.constants `Quot.mk = some (some quotMkConst) quot : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ HasType env1✝ quotLiftConst.uvars [] quotLiftConst.type (VExpr.sort (?m.5951 x✝ left✝¹ left✝ quot eq right✝)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
type_tac
env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ HasType env1✝ quotDefEq.uvars [] quotDefEq.lhs quotDefEq.type
no goals
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ HasType env1✝ quotDefEq.uvars [] quotDefEq.lhs quotDefEq.type TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_WF
[7, 1]
[14, 78]
type_tac
env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ HasType env1✝ quotDefEq.uvars [] quotDefEq.rhs quotDefEq.type
no goals
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv henv✝³ : Ordered env hq : QuotReady env env1✝³ : VEnv henv✝² : Ordered env1✝³ env1✝² : VEnv henv✝¹ : Ordered env1✝² env1✝¹ : VEnv henv✝ : Ordered env1✝¹ env1✝ : VEnv henv : Ordered env1✝ left✝³ : env1✝.constants `Quot.lift = some (some quotLiftConst) left✝² : env1✝.constants `Quot.ind = some (some quotIndConst) left✝¹ : env1✝.constants `Quot.mk = some (some quotMkConst) left✝ : env1✝.constants `Quot = some (some quotConst) eq : env1✝.constants `Eq = some (some eqConst) right✝ : HasObjects env1✝ [] ⊒ HasType env1✝ quotDefEq.uvars [] quotDefEq.rhs quotDefEq.type TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_objs
[19, 1]
[25, 45]
let ⟨env, h, henv⟩ := HasObjects.bind_const (ls := []) trivial henv
env env' : VEnv henv : addQuot env = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
env✝ env' : VEnv henv✝ : addQuot env✝ = some env' env : VEnv h : HasObjects env [VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
Please generate a tactic in lean4 to solve the state. STATE: env env' : VEnv henv : addQuot env = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_objs
[19, 1]
[25, 45]
let ⟨env, h, henv⟩ := HasObjects.bind_const h henv
env✝ env' : VEnv henv✝ : addQuot env✝ = some env' env : VEnv h : HasObjects env [VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
env✝¹ env' : VEnv henv✝¹ : addQuot env✝¹ = some env' env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot (some quotConst)] henv✝ : (do let env ← addConst env✝ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env : VEnv h : HasObjects env [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
Please generate a tactic in lean4 to solve the state. STATE: env✝ env' : VEnv henv✝ : addQuot env✝ = some env' env : VEnv h : HasObjects env [VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_objs
[19, 1]
[25, 45]
let ⟨env, h, henv⟩ := HasObjects.bind_const h henv
env✝¹ env' : VEnv henv✝¹ : addQuot env✝¹ = some env' env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot (some quotConst)] henv✝ : (do let env ← addConst env✝ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env : VEnv h : HasObjects env [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
env✝² env' : VEnv henv✝² : addQuot env✝² = some env' env✝¹ : VEnv h✝¹ : HasObjects env✝¹ [VObject.const `Quot (some quotConst)] henv✝¹ : (do let env ← addConst env✝¹ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv✝ : (do let env ← addConst env✝ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env : VEnv h : HasObjects env [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
Please generate a tactic in lean4 to solve the state. STATE: env✝¹ env' : VEnv henv✝¹ : addQuot env✝¹ = some env' env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot (some quotConst)] henv✝ : (do let env ← addConst env✝ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env : VEnv h : HasObjects env [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_objs
[19, 1]
[25, 45]
obtain ⟨env, h, ⟨⟩⟩ := HasObjects.bind_const h henv
env✝² env' : VEnv henv✝² : addQuot env✝² = some env' env✝¹ : VEnv h✝¹ : HasObjects env✝¹ [VObject.const `Quot (some quotConst)] henv✝¹ : (do let env ← addConst env✝¹ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv✝ : (do let env ← addConst env✝ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env : VEnv h : HasObjects env [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
case intro.intro.refl env✝³ env✝² : VEnv h✝² : HasObjects env✝² [VObject.const `Quot (some quotConst)] env✝¹ : VEnv h✝¹ : HasObjects env✝¹ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] env : VEnv h : HasObjects env [VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv✝² : addQuot env✝³ = some (addDefEq env quotDefEq) henv✝¹ : (do let env ← addConst env✝² `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) henv✝ : (do let env ← addConst env✝¹ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) henv : (do let env ← addConst env✝ `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) ⊒ HasObjects (addDefEq env quotDefEq) [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
Please generate a tactic in lean4 to solve the state. STATE: env✝² env' : VEnv henv✝² : addQuot env✝² = some env' env✝¹ : VEnv h✝¹ : HasObjects env✝¹ [VObject.const `Quot (some quotConst)] henv✝¹ : (do let env ← addConst env✝¹ `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv✝ : (do let env ← addConst env✝ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' env : VEnv h : HasObjects env [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv : (do let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some env' ⊒ HasObjects env' [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/QuotLemmas.lean
Lean4Lean.VEnv.addQuot_objs
[19, 1]
[25, 45]
exact HasObjects.defeq (df := quotDefEq) h
case intro.intro.refl env✝³ env✝² : VEnv h✝² : HasObjects env✝² [VObject.const `Quot (some quotConst)] env✝¹ : VEnv h✝¹ : HasObjects env✝¹ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] env : VEnv h : HasObjects env [VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv✝² : addQuot env✝³ = some (addDefEq env quotDefEq) henv✝¹ : (do let env ← addConst env✝² `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) henv✝ : (do let env ← addConst env✝¹ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) henv : (do let env ← addConst env✝ `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) ⊒ HasObjects (addDefEq env quotDefEq) [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)]
no goals
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.refl env✝³ env✝² : VEnv h✝² : HasObjects env✝² [VObject.const `Quot (some quotConst)] env✝¹ : VEnv h✝¹ : HasObjects env✝¹ [VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] env✝ : VEnv h✝ : HasObjects env✝ [VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] env : VEnv h : HasObjects env [VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] henv✝² : addQuot env✝³ = some (addDefEq env quotDefEq) henv✝¹ : (do let env ← addConst env✝² `Quot.mk (some quotMkConst) let env ← addConst env `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) henv✝ : (do let env ← addConst env✝¹ `Quot.ind (some quotIndConst) let env ← addConst env `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) henv : (do let env ← addConst env✝ `Quot.lift (some quotLiftConst) some (addDefEq env quotDefEq)) = some (addDefEq env quotDefEq) ⊒ HasObjects (addDefEq env quotDefEq) [VObject.defeq quotDefEq, VObject.const `Quot.lift (some quotLiftConst), VObject.const `Quot.ind (some quotIndConst), VObject.const `Quot.mk (some quotMkConst), VObject.const `Quot (some quotConst)] TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.DefInv.symm
[17, 8]
[20, 78]
cases e1 <;> cases e2 <;> try trivial
env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr e1 e2 : VExpr h : DefInv env U Ξ“ e1 e2 ⊒ DefInv env U Ξ“ e2 e1
case sort.sort env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr u✝¹ u✝ : VLevel h : DefInv env U Ξ“ (sort u✝¹) (sort u✝) ⊒ DefInv env U Ξ“ (sort u✝) (sort u✝¹) case forallE.forallE env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (forallE binderType✝ body✝) ⊒ DefInv env U Ξ“ (forallE binderType✝ body✝) (forallE binderType✝¹ body✝¹)
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr e1 e2 : VExpr h : DefInv env U Ξ“ e1 e2 ⊒ DefInv env U Ξ“ e2 e1 TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.DefInv.symm
[17, 8]
[20, 78]
trivial
case forallE.lam env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (lam binderType✝ body✝) ⊒ DefInv env U Ξ“ (lam binderType✝ body✝) (forallE binderType✝¹ body✝¹)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case forallE.lam env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (lam binderType✝ body✝) ⊒ DefInv env U Ξ“ (lam binderType✝ body✝) (forallE binderType✝¹ body✝¹) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.DefInv.symm
[17, 8]
[20, 78]
exact h.symm
case sort.sort env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr u✝¹ u✝ : VLevel h : DefInv env U Ξ“ (sort u✝¹) (sort u✝) ⊒ DefInv env U Ξ“ (sort u✝) (sort u✝¹)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case sort.sort env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr u✝¹ u✝ : VLevel h : DefInv env U Ξ“ (sort u✝¹) (sort u✝) ⊒ DefInv env U Ξ“ (sort u✝) (sort u✝¹) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.DefInv.symm
[17, 8]
[20, 78]
let ⟨u, v, h1, h2⟩ := h
case forallE.forallE env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (forallE binderType✝ body✝) ⊒ DefInv env U Ξ“ (forallE binderType✝ body✝) (forallE binderType✝¹ body✝¹)
case forallE.forallE env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (forallE binderType✝ body✝) u v : VLevel h1 : IsDefEq env U Ξ“ binderType✝¹ binderType✝ (sort u) h2 : IsDefEq env U (binderType✝¹ :: Ξ“) body✝¹ body✝ (sort v) ⊒ DefInv env U Ξ“ (forallE binderType✝ body✝) (forallE binderType✝¹ body✝¹)
Please generate a tactic in lean4 to solve the state. STATE: case forallE.forallE env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (forallE binderType✝ body✝) ⊒ DefInv env U Ξ“ (forallE binderType✝ body✝) (forallE binderType✝¹ body✝¹) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.DefInv.symm
[17, 8]
[20, 78]
exact ⟨u, v, h1.symm, h1.defeqDF_l henv h2.symm⟩
case forallE.forallE env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (forallE binderType✝ body✝) u v : VLevel h1 : IsDefEq env U Ξ“ binderType✝¹ binderType✝ (sort u) h2 : IsDefEq env U (binderType✝¹ :: Ξ“) body✝¹ body✝ (sort v) ⊒ DefInv env U Ξ“ (forallE binderType✝ body✝) (forallE binderType✝¹ body✝¹)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case forallE.forallE env : VEnv henv : Ordered env U : Nat Ξ“ : List VExpr binderType✝¹ body✝¹ binderType✝ body✝ : VExpr h : DefInv env U Ξ“ (forallE binderType✝¹ body✝¹) (forallE binderType✝ body✝) u v : VLevel h1 : IsDefEq env U Ξ“ binderType✝¹ binderType✝ (sort u) h2 : IsDefEq env U (binderType✝¹ :: Ξ“) body✝¹ body✝ (sort v) ⊒ DefInv env U Ξ“ (forallE binderType✝ body✝) (forallE binderType✝¹ body✝¹) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
have H' := H.strong henv hΞ“
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H : IsDefEq env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H : IsDefEq env U Ξ“ e1 e2 A H' : IsDefEqStrong env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H : IsDefEq env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
clear hΞ“ H
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H : IsDefEq env U Ξ“ e1 e2 A H' : IsDefEqStrong env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H' : IsDefEqStrong env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env hΞ“ : OnCtx Ξ“ (IsType env U) e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H : IsDefEq env U Ξ“ e1 e2 A H' : IsDefEqStrong env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
induction H' with | bvar h => exact ⟨.bvar h, .bvar h, .refl (hty (.bvar h))⟩ | symm _ ih => exact ⟨ih.2.1, ih.1, .symm ih.2.2⟩ | trans _ _ ih1 ih2 => exact ⟨ih1.1, ih2.2.1, .trans ih1.2.2 ih2.2.2⟩ | @constDF _ _ ls₁ lsβ‚‚ u _ h1 h2 h3 h4 h5 => exact ⟨.const h1 h2 h4, .defeq (u := u.inst ls₁) sorry <| .const h1 h3 (h5.length_eq.symm.trans h4), .constDF h1 h2 h3 h4 h5⟩ | @sortDF l l' _ h1 h2 h3 => refine ⟨.sort h1, ?_, .sortDF h1 h2 h3⟩ exact .defeq (hdf <| .symm <| .sortDF (l' := l'.succ) h1 h2 (VLevel.succ_congr h3)) (.sort h2) | appDF _ _ _ _ _ _ _ _ _ ihf iha ihBa => let ⟨hf, hf', ff⟩ := ihf; let ⟨ha, ha', aa⟩ := iha exact ⟨.app hf ha, .defeq (hdf ihBa.2.2.symm) (.app hf' ha'), .appDF ff aa⟩ | lamDF _ _ _ _ _ _ _ ihA ihB _ ihb ihb' => refine ⟨.lam ihA.1 ihb.1, ?_, .lamDF ihA.2.2 ihb.2.2⟩ exact .defeq (hdf <| .symm <| .forallEDF ihA.2.2 ihB.2.2) <| .lam ihA.2.1 ihb'.2.1 | forallEDF _ _ _ _ _ ih1 ih2 ih3 => exact ⟨.forallE ih1.1 ih2.1, .forallE ih1.2.1 ih3.2.1, .forallEDF ih1.2.2 ih2.2.2⟩ | defeqDF _ _ _ ih1 ih2 => exact ⟨.defeq (hdf ih1.2.2) ih2.1, .defeq (hdf ih1.2.2) ih2.2.1, .defeqDF (hdf ih1.2.2) ih2.2.2⟩ | beta _ _ _ _ _ _ _ _ ihA _ ihe ihe' _ ihee => exact ⟨.app (.lam ihA.1 ihe.1) ihe'.1, ihee.1, .beta (hty ihe.1) (hty ihe'.1)⟩ | eta _ _ _ _ _ _ _ ihA _ _ ihe ihe' => have := HasType1.app ihe'.1 (.bvar .zero) rw [instN_bvar0] at this exact ⟨.lam ihA.1 this, ihe.1, .eta (hty ihe.1)⟩ | proofIrrel _ _ _ ih1 ih2 ih3 => exact ⟨ih2.1, ih3.1, .proofIrrel (hty ih1.1) (hty ih2.1) (hty ih3.1)⟩ | extra h1 h2 h3 _ _ _ _ _ _ _ _ _ ihl' ihr' => exact ⟨ihl'.1, ihr'.1, .extra h1 h2 h3⟩
env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H' : IsDefEqStrong env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A
no goals
Please generate a tactic in lean4 to solve the state. STATE: env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A H' : IsDefEqStrong env U Ξ“ e1 e2 A ⊒ HasType1 env U defEq Ξ“ e1 A ∧ HasType1 env U defEq Ξ“ e2 A ∧ IsDefEq1 env U hasType defEq Ξ“ e1 e2 A TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
exact ⟨.bvar h, .bvar h, .refl (hty (.bvar h))⟩
case bvar env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr i✝ : Nat A✝ : VExpr u✝ : VLevel h : Lookup Ξ“βœ i✝ A✝ a✝¹ : VLevel.WF U u✝ a✝ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) ⊒ HasType1 env U defEq Ξ“βœ (VExpr.bvar i✝) A✝ ∧ HasType1 env U defEq Ξ“βœ (VExpr.bvar i✝) A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.bvar i✝) (VExpr.bvar i✝) A✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case bvar env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr i✝ : Nat A✝ : VExpr u✝ : VLevel h : Lookup Ξ“βœ i✝ A✝ a✝¹ : VLevel.WF U u✝ a✝ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) ⊒ HasType1 env U defEq Ξ“βœ (VExpr.bvar i✝) A✝ ∧ HasType1 env U defEq Ξ“βœ (VExpr.bvar i✝) A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.bvar i✝) (VExpr.bvar i✝) A✝ TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
exact ⟨ih.2.1, ih.1, .symm ih.2.2⟩
case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : HasType1 env U defEq Ξ“βœ e✝ A✝ ∧ HasType1 env U defEq Ξ“βœ e'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ e✝ e'✝ A✝ ⊒ HasType1 env U defEq Ξ“βœ e'✝ A✝ ∧ HasType1 env U defEq Ξ“βœ e✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ e'✝ e✝ A✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case symm env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr e✝ e'✝ A✝ : VExpr a✝ : IsDefEqStrong env U Ξ“βœ e✝ e'✝ A✝ ih : HasType1 env U defEq Ξ“βœ e✝ A✝ ∧ HasType1 env U defEq Ξ“βœ e'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ e✝ e'✝ A✝ ⊒ HasType1 env U defEq Ξ“βœ e'✝ A✝ ∧ HasType1 env U defEq Ξ“βœ e✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ e'✝ e✝ A✝ TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
exact ⟨ih1.1, ih2.2.1, .trans ih1.2.2 ih2.2.2⟩
case trans env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr eβ‚βœ eβ‚‚βœ A✝ eβ‚ƒβœ : VExpr a✝¹ : IsDefEqStrong env U Ξ“βœ eβ‚βœ eβ‚‚βœ A✝ a✝ : IsDefEqStrong env U Ξ“βœ eβ‚‚βœ eβ‚ƒβœ A✝ ih1 : HasType1 env U defEq Ξ“βœ eβ‚βœ A✝ ∧ HasType1 env U defEq Ξ“βœ eβ‚‚βœ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ eβ‚βœ eβ‚‚βœ A✝ ih2 : HasType1 env U defEq Ξ“βœ eβ‚‚βœ A✝ ∧ HasType1 env U defEq Ξ“βœ eβ‚ƒβœ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ eβ‚‚βœ eβ‚ƒβœ A✝ ⊒ HasType1 env U defEq Ξ“βœ eβ‚βœ A✝ ∧ HasType1 env U defEq Ξ“βœ eβ‚ƒβœ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ eβ‚βœ eβ‚ƒβœ A✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case trans env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr eβ‚βœ eβ‚‚βœ A✝ eβ‚ƒβœ : VExpr a✝¹ : IsDefEqStrong env U Ξ“βœ eβ‚βœ eβ‚‚βœ A✝ a✝ : IsDefEqStrong env U Ξ“βœ eβ‚‚βœ eβ‚ƒβœ A✝ ih1 : HasType1 env U defEq Ξ“βœ eβ‚βœ A✝ ∧ HasType1 env U defEq Ξ“βœ eβ‚‚βœ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ eβ‚βœ eβ‚‚βœ A✝ ih2 : HasType1 env U defEq Ξ“βœ eβ‚‚βœ A✝ ∧ HasType1 env U defEq Ξ“βœ eβ‚ƒβœ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ eβ‚‚βœ eβ‚ƒβœ A✝ ⊒ HasType1 env U defEq Ξ“βœ eβ‚βœ A✝ ∧ HasType1 env U defEq Ξ“βœ eβ‚ƒβœ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ eβ‚βœ eβ‚ƒβœ A✝ TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
exact ⟨.const h1 h2 h4, .defeq (u := u.inst ls₁) sorry <| .const h1 h3 (h5.length_eq.symm.trans h4), .constDF h1 h2 h3 h4 h5⟩
case constDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A c✝ : Name ci✝ : VConstant ls₁ lsβ‚‚ : List VLevel u : VLevel Ξ“βœ : List VExpr h1 : env.constants c✝ = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls₁ β†’ VLevel.WF U l h3 : βˆ€ (l : VLevel), l ∈ lsβ‚‚ β†’ VLevel.WF U l h4 : List.length ls₁ = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls₁ lsβ‚‚ a✝⁴ : VLevel.WF U u a✝³ : IsDefEqStrong env U [] (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a✝² : IsDefEqStrong env U [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) a_ih✝³ : HasType1 env U defEq [] (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq [] (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq [] (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a_ih✝² : HasType1 env U defEq [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) a_ih✝¹ : HasType1 env U defEq Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a_ih✝ : HasType1 env U defEq Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ⊒ HasType1 env U defEq Ξ“βœ (VExpr.const c✝ ls₁) (VExpr.instL ls₁ ci✝.type) ∧ HasType1 env U defEq Ξ“βœ (VExpr.const c✝ lsβ‚‚) (VExpr.instL ls₁ ci✝.type) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.const c✝ ls₁) (VExpr.const c✝ lsβ‚‚) (VExpr.instL ls₁ ci✝.type)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case constDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A c✝ : Name ci✝ : VConstant ls₁ lsβ‚‚ : List VLevel u : VLevel Ξ“βœ : List VExpr h1 : env.constants c✝ = some (some ci✝) h2 : βˆ€ (l : VLevel), l ∈ ls₁ β†’ VLevel.WF U l h3 : βˆ€ (l : VLevel), l ∈ lsβ‚‚ β†’ VLevel.WF U l h4 : List.length ls₁ = ci✝.uvars h5 : List.Forallβ‚‚ (fun x x_1 => x β‰ˆ x_1) ls₁ lsβ‚‚ a✝⁴ : VLevel.WF U u a✝³ : IsDefEqStrong env U [] (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a✝² : IsDefEqStrong env U [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) a✝¹ : IsDefEqStrong env U Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a✝ : IsDefEqStrong env U Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) a_ih✝³ : HasType1 env U defEq [] (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq [] (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq [] (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a_ih✝² : HasType1 env U defEq [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq [] (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) a_ih✝¹ : HasType1 env U defEq Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.instL ls₁ ci✝.type) (VExpr.instL ls₁ ci✝.type) (VExpr.sort u) a_ih✝ : HasType1 env U defEq Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ HasType1 env U defEq Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.instL lsβ‚‚ ci✝.type) (VExpr.sort u) ⊒ HasType1 env U defEq Ξ“βœ (VExpr.const c✝ ls₁) (VExpr.instL ls₁ ci✝.type) ∧ HasType1 env U defEq Ξ“βœ (VExpr.const c✝ lsβ‚‚) (VExpr.instL ls₁ ci✝.type) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.const c✝ ls₁) (VExpr.const c✝ lsβ‚‚) (VExpr.instL ls₁ ci✝.type) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
refine ⟨.sort h1, ?_, .sortDF h1 h2 h3⟩
case sortDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A l l' : VLevel Ξ“βœ : List VExpr h1 : VLevel.WF U l h2 : VLevel.WF U l' h3 : l β‰ˆ l' ⊒ HasType1 env U defEq Ξ“βœ (VExpr.sort l) (VExpr.sort (VLevel.succ l)) ∧ HasType1 env U defEq Ξ“βœ (VExpr.sort l') (VExpr.sort (VLevel.succ l)) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.sort l) (VExpr.sort l') (VExpr.sort (VLevel.succ l))
case sortDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A l l' : VLevel Ξ“βœ : List VExpr h1 : VLevel.WF U l h2 : VLevel.WF U l' h3 : l β‰ˆ l' ⊒ HasType1 env U defEq Ξ“βœ (VExpr.sort l') (VExpr.sort (VLevel.succ l))
Please generate a tactic in lean4 to solve the state. STATE: case sortDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A l l' : VLevel Ξ“βœ : List VExpr h1 : VLevel.WF U l h2 : VLevel.WF U l' h3 : l β‰ˆ l' ⊒ HasType1 env U defEq Ξ“βœ (VExpr.sort l) (VExpr.sort (VLevel.succ l)) ∧ HasType1 env U defEq Ξ“βœ (VExpr.sort l') (VExpr.sort (VLevel.succ l)) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (VExpr.sort l) (VExpr.sort l') (VExpr.sort (VLevel.succ l)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
exact .defeq (hdf <| .symm <| .sortDF (l' := l'.succ) h1 h2 (VLevel.succ_congr h3)) (.sort h2)
case sortDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A l l' : VLevel Ξ“βœ : List VExpr h1 : VLevel.WF U l h2 : VLevel.WF U l' h3 : l β‰ˆ l' ⊒ HasType1 env U defEq Ξ“βœ (VExpr.sort l') (VExpr.sort (VLevel.succ l))
no goals
Please generate a tactic in lean4 to solve the state. STATE: case sortDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A l l' : VLevel Ξ“βœ : List VExpr h1 : VLevel.WF U l h2 : VLevel.WF U l' h3 : l β‰ˆ l' ⊒ HasType1 env U defEq Ξ“βœ (VExpr.sort l') (VExpr.sort (VLevel.succ l)) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
let ⟨hf, hf', ff⟩ := ihf
case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷)
case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) hf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) hf' : HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ff : IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷)
Please generate a tactic in lean4 to solve the state. STATE: case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
let ⟨ha, ha', aa⟩ := iha
case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) hf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) hf' : HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ff : IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷)
case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) hf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) hf' : HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ff : IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) ha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ha' : HasType1 env U defEq Ξ“βœ a'✝ A✝ aa : IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷)
Please generate a tactic in lean4 to solve the state. STATE: case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) hf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) hf' : HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ff : IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
exact ⟨.app hf ha, .defeq (hdf ihBa.2.2.symm) (.app hf' ha'), .appDF ff aa⟩
case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) hf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) hf' : HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ff : IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) ha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ha' : HasType1 env U defEq Ξ“βœ a'✝ A✝ aa : IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case appDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel f✝ f'✝ a✝⁷ a'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) a✝¹ : IsDefEqStrong env U Ξ“βœ a✝⁷ a'✝ A✝ a✝ : IsDefEqStrong env U Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) a_ih✝¹ : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A✝ (VExpr.sort u✝) a_ih✝ : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) iha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ∧ HasType1 env U defEq Ξ“βœ a'✝ A✝ ∧ IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ihBa : HasType1 env U defEq Ξ“βœ (inst B✝ a✝⁷) (VExpr.sort v✝) ∧ HasType1 env U defEq Ξ“βœ (inst B✝ a'✝) (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (inst B✝ a✝⁷) (inst B✝ a'✝) (VExpr.sort v✝) hf : HasType1 env U defEq Ξ“βœ f✝ (VExpr.forallE A✝ B✝) hf' : HasType1 env U defEq Ξ“βœ f'✝ (VExpr.forallE A✝ B✝) ff : IsDefEq1 env U hasType defEq Ξ“βœ f✝ f'✝ (VExpr.forallE A✝ B✝) ha : HasType1 env U defEq Ξ“βœ a✝⁷ A✝ ha' : HasType1 env U defEq Ξ“βœ a'✝ A✝ aa : IsDefEq1 env U hasType defEq Ξ“βœ a✝⁷ a'✝ A✝ ⊒ HasType1 env U defEq Ξ“βœ (app f✝ a✝⁷) (inst B✝ a✝⁷) ∧ HasType1 env U defEq Ξ“βœ (app f'✝ a'✝) (inst B✝ a✝⁷) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (app f✝ a✝⁷) (app f'✝ a'✝) (inst B✝ a✝⁷) TACTIC:
https://github.com/digama0/lean4lean.git
c534f13d8d25f5e1891b6d18cc76b601ee87aa66
Lean4Lean/Theory/Typing/Stratified.lean
Lean4Lean.VEnv.IsDefEq.induction1
[75, 1]
[115, 44]
refine ⟨.lam ihA.1 ihb.1, ?_, .lamDF ihA.2.2 ihb.2.2⟩
case lamDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ body'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ ihA : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A'✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ihB : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝ : HasType1 env U defEq (A'✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A'✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihb : HasType1 env U defEq (A✝ :: Ξ“βœ) body✝ B✝ ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) body'✝ B✝ ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ihb' : HasType1 env U defEq (A'✝ :: Ξ“βœ) body✝ B✝ ∧ HasType1 env U defEq (A'✝ :: Ξ“βœ) body'✝ B✝ ∧ IsDefEq1 env U hasType defEq (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ ⊒ HasType1 env U defEq Ξ“βœ (lam A✝ body✝) (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ (lam A'✝ body'✝) (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝)
case lamDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ body'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ ihA : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A'✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ihB : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝ : HasType1 env U defEq (A'✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A'✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihb : HasType1 env U defEq (A✝ :: Ξ“βœ) body✝ B✝ ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) body'✝ B✝ ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ihb' : HasType1 env U defEq (A'✝ :: Ξ“βœ) body✝ B✝ ∧ HasType1 env U defEq (A'✝ :: Ξ“βœ) body'✝ B✝ ∧ IsDefEq1 env U hasType defEq (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ ⊒ HasType1 env U defEq Ξ“βœ (lam A'✝ body'✝) (VExpr.forallE A✝ B✝)
Please generate a tactic in lean4 to solve the state. STATE: case lamDF env : VEnv Ξ“ : List VExpr U : Nat henv : Ordered env e1 e2 A : VExpr defEq : List VExpr β†’ VExpr β†’ VExpr β†’ VExpr β†’ Prop hasType : List VExpr β†’ VExpr β†’ VExpr β†’ Prop hty : βˆ€ {Ξ“ : List VExpr} {e A : VExpr}, HasType1 env U defEq Ξ“ e A β†’ hasType Ξ“ e A hdf : βˆ€ {Ξ“ : List VExpr} {e1 e2 A : VExpr}, IsDefEq1 env U hasType defEq Ξ“ e1 e2 A β†’ defEq Ξ“ e1 e2 A Ξ“βœ : List VExpr A✝ A'✝ : VExpr u✝ : VLevel B✝ : VExpr v✝ : VLevel body✝ body'✝ : VExpr a✝⁢ : VLevel.WF U u✝ a✝⁡ : VLevel.WF U v✝ a✝⁴ : IsDefEqStrong env U Ξ“βœ A✝ A'✝ (VExpr.sort u✝) a✝³ : IsDefEqStrong env U (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝² : IsDefEqStrong env U (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a✝¹ : IsDefEqStrong env U (A✝ :: Ξ“βœ) body✝ body'✝ B✝ a✝ : IsDefEqStrong env U (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ ihA : HasType1 env U defEq Ξ“βœ A✝ (VExpr.sort u✝) ∧ HasType1 env U defEq Ξ“βœ A'✝ (VExpr.sort u✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ A✝ A'✝ (VExpr.sort u✝) ihB : HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) a_ih✝ : HasType1 env U defEq (A'✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ HasType1 env U defEq (A'✝ :: Ξ“βœ) B✝ (VExpr.sort v✝) ∧ IsDefEq1 env U hasType defEq (A'✝ :: Ξ“βœ) B✝ B✝ (VExpr.sort v✝) ihb : HasType1 env U defEq (A✝ :: Ξ“βœ) body✝ B✝ ∧ HasType1 env U defEq (A✝ :: Ξ“βœ) body'✝ B✝ ∧ IsDefEq1 env U hasType defEq (A✝ :: Ξ“βœ) body✝ body'✝ B✝ ihb' : HasType1 env U defEq (A'✝ :: Ξ“βœ) body✝ B✝ ∧ HasType1 env U defEq (A'✝ :: Ξ“βœ) body'✝ B✝ ∧ IsDefEq1 env U hasType defEq (A'✝ :: Ξ“βœ) body✝ body'✝ B✝ ⊒ HasType1 env U defEq Ξ“βœ (lam A✝ body✝) (VExpr.forallE A✝ B✝) ∧ HasType1 env U defEq Ξ“βœ (lam A'✝ body'✝) (VExpr.forallE A✝ B✝) ∧ IsDefEq1 env U hasType defEq Ξ“βœ (lam A✝ body✝) (lam A'✝ body'✝) (VExpr.forallE A✝ B✝) TACTIC: