lean4-htt/tests/lean/run/1549.lean
Joe Hendrix 8b0dd2e835
chore: upstream Std.Logic (#3312)
This will collect definitions from Std.Logic

---------

Co-authored-by: David Thrane Christiansen <david@davidchristiansen.dk>
Co-authored-by: Scott Morrison <scott.morrison@gmail.com>
2024-02-14 09:40:55 +00:00

14 lines
579 B
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.

theorem not_mem_nil (a : Nat) : ¬ a ∈ [] := fun x => nomatch x
example (R : Nat → Prop) : (∀ (a' : Nat), a' ∈ [] → R a') := by
simp only [forall_prop_of_false (not_mem_nil _)]
exact fun _ => True.intro
def Not.elim' {α : Sort _} (H1 : ¬a) (H2 : a) : α := absurd H2 H1
theorem iff_of_true' (ha : a) (hb : b) : a ↔ b := ⟨fun _ => hb, fun _ => ha⟩
theorem iff_true_intro' (h : a) : a ↔ True := iff_of_true h ⟨⟩
example {P : Prop} : ∀ (x : Nat) (_ : x ∈ []), P :=
by
simp only [forall_prop_of_false (not_mem_nil _)]
exact fun _ => True.intro