Given an expression, return the array of positions of
minimal non-implication subexpressions
e.g. for ((a → b → c) → (d → e))
, we have
[(0, 0), (0, 1, 0), (0, 1, 1), (1, 0), (1, 1)]
Equations
Instances For
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
- Auto.Inhabitation.getExprNonImpPosition.go [] e = some e
- Auto.Inhabitation.getExprNonImpPosition.go (b :: pos_2) e = none
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
def
Auto.Inhabitation.inhFactMatchAtomTys.canonicalize
(inhTy : Lean.Expr)
(atomTys : Array Lean.Expr)
:
Equations
- One or more equations did not get rendered due to their size.
- Auto.Inhabitation.inhFactMatchAtomTys.canonicalize inhTy atomTys = Auto.Inhabitation.inhFactMatchAtomTys.canonicalizeAtomic inhTy atomTys
Instances For
def
Auto.Inhabitation.inhFactMatchAtomTys.canonicalizeAtomic
(inhTy : Lean.Expr)
(atomTys : Array Lean.Expr)
:
Equations
- One or more equations did not get rendered due to their size.