Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with beginner
Search options not deleted
user 159
Questions asked by a beginner user of proof assistants. We make an effort to be extra kind to such users.
5
votes
How to prove a property of a conditional statement without using tactics in Lean?
Instead of using ite to branch on p you want to use match on the Decidable p instance like so:
def f [d : Decidable p] (h : p) : ite p p True :=
match d with
| isTrue _ => h
| isFalse _ => triv …
- 361