lean2/tests/lean/simplifier9.lean
2015-11-16 20:33:22 -08:00

29 lines
1 KiB
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

-- Rewriting with (tmp)-local hypotheses
import logic.quantifiers
attribute congr_imp [congr]
attribute congr_forall [congr]
universe l
constants (T : Type.{l}) (P Q : T → Prop)
set_option simplify.max_steps 50000
constants (x y : T)
#simplify iff env 0 x = y → x = y
#simplify iff env 0 T → x = y → x = y
#simplify iff env 0 ∀ z : T, x = z → x = y
#simplify iff env 0 ∀ z : T, z = x → x = z
#simplify iff env 0 ∀ (z w : T), x = y → x = y
#simplify iff env 0 ∀ (z w : T), x = y → P x
#simplify iff env 0 ∀ (H : ∀ x, P x ↔ Q x), P x
#simplify iff env 0 ∀ (p : Prop) (H : ∀ x, P x ↔ Q x) (q : Prop), P x
#simplify iff env 0 ∀ (p : Prop) (H : ∀ x, P x ↔ Q x), p P x
#simplify iff env 0 (∀ (x : T), P x ↔ Q x) → P x
#simplify iff env 0 ∀ (x y : T), (∀ (x : T), P x ↔ Q x) → P x
#simplify iff env 0 ∀ (x z : T), x = z → P x
#simplify iff env 0 ∀ (x y z : T), x = y → y = z → P x
#simplify iff env 0 ∀ (x z : T), x = z → (∀ (w : T), P w ↔ Q w) → P x