09b51a0fb7
The elaborator was missing solutions because of the missing condition at is_simple_ho_match. This commit also adds a new test that exposes the problem. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
25 lines
793 B
Text
25 lines
793 B
Text
Set: pp::colors
|
||
Set: pp::unicode
|
||
Assumed: N
|
||
Assumed: a
|
||
Assumed: b
|
||
Assumed: c
|
||
Assumed: P
|
||
Assumed: H3
|
||
Proved: T1
|
||
Proved: T2
|
||
Proved: T3
|
||
Proved: T4
|
||
Theorem T1 : ∃ x y z : N, P x y z :=
|
||
ExistsIntro::explicit
|
||
N
|
||
(λ x : N, ∃ y z : N, P x y z)
|
||
a
|
||
(ExistsIntro::explicit
|
||
N
|
||
(λ x : N, if ((λ x::1 : N, if (P a x x::1) ⊥ ⊤) == (λ x : N, ⊤)) ⊥ ⊤)
|
||
b
|
||
(ExistsIntro::explicit N (λ z : N, P a b z) c H3))
|
||
Theorem T2 : ∃ x y z : N, P x y z := ExistsIntro a (ExistsIntro b (ExistsIntro c H3))
|
||
Theorem T3 : ∃ x y z : N, P x y z := ExistsIntro a (ExistsIntro b (ExistsIntro c H3))
|
||
Theorem T4 (H : P a a b) : ∃ x y z : N, P x y z := ExistsIntro a (ExistsIntro a (ExistsIntro b H))
|