-
Notifications
You must be signed in to change notification settings - Fork 3
Trestle refactor #26
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Trestle refactor #26
Conversation
@@ -75,11 +78,49 @@ lemma mem_vars_of_flip {φ : PropForm ν} {τ : PropAssignment ν} (x : ν) : τ | |||
simp_all only [vars, satisfies_var, Finset.mem_singleton] | |||
by_contra h | |||
exact hτ' (hτ ▸ τ.set_get_of_ne (!τ x) h) | |||
| _ => | |||
simp_all only | |||
[satisfies_conj, satisfies_disj, satisfies_impl', satisfies_biImpl', vars, Finset.mem_union] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I know the simp_all proof is slow, but it is likely more robust to change, and easier to maintain. tradeoff worth considering.
@@ -50,18 +51,22 @@ section subst | |||
|
|||
variable (f f₁ : ν₁ → PropForm ν₂) (f₂ : ν₂ → PropForm ν₃) (φ φ₁ φ₂ : PropForm ν₁) | |||
|
|||
-- CC: Unnecessary block of theorems, if the definition is `reducible` anyways? |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Unless simp has changed recently, you can have definitional equations like this where the LHS is simp-normal (ie you need to add it as a simp lemma). I don't remember how to determine when it is/isn't necessary though
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
oh i see what you mean
still no clue if the simps are necessary or not.
No description provided.