8 lines
329 B
Text
8 lines
329 B
Text
import Int.
|
|
variable P : Int -> Int -> Int -> Bool
|
|
axiom Ax1 : exists x y z, P x y z
|
|
axiom Ax2 : forall x y z, not (P x y z)
|
|
theorem T : false :=
|
|
exists_elim Ax1 (fun a H1, exists_elim H1 (fun b H2, exists_elim H2 (fun (c : Int) (H3 : P a b c),
|
|
let notH3 : not (P a b c) := Ax2 a b c
|
|
in absurd H3 notH3)))
|