FormalConjecturesTest/Util/Answer.lean
7 declarations, 5 contain sorry, 0 declared as axioms
Imports (2)
- theorem
fooline 33 sourceno axioms what this means
Proof uses:
True.intro1 instances, coercions and auxiliary constants left out.
Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
- theorem
barsorry line 39 sourcedepends on sorry what this means
Statement uses:
Eq,Nat,OfNat.ofNatProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous4 instances, coercions and auxiliary constants left out.
Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
- theorem
bar_symmsorry line 47 sourcedepends on sorry what this means
Statement uses:
Eq,Nat,OfNat.ofNatProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous4 instances, coercions and auxiliary constants left out.
Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
- theorem
bar_symm_explicitsorry line 55 sourcedepends on sorry what this means
Statement uses:
Eq,Nat,OfNat.ofNatProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous4 instances, coercions and auxiliary constants left out.
Tactic trace: 3 steps
Open to load the checked before-and-after goal states.
- theorem
i_have_some_universessorry line 63 sourcedepends on sorry what this means
Statement uses:
Eq,ProdProof uses:
sorryAx,Lean.Name,Bool.false,Lean.Name.num,Lean.Name.str,Lean.Name.anonymous,OfNat.ofNat,Nat3 instances, coercions and auxiliary constants left out.
Tactic trace: 2 steps
Open to load the checked before-and-after goal states.
- theorem
this_workssorry line 73 sourceno axioms what this means
Statement uses:
TrueProof uses:
True.introTactic trace: 1 steps
Open to load the checked before-and-after goal states.
- abbrev
cline 82 source