![](/img/trans.png)
[英]How or is that possible to prove or falsify `forall (P Q : Prop), (P -> Q) -> (Q -> P) -> P = Q.` in Coq?
[英]How to prove for all functions P, Q from typical type to `Prop`, “forall a, b, P(a) or Q(b) holds” iff “forall a, P(a), or, forall b, Q(b), holds”?
Lemma forall_P_Q_a_b_notPa_or_notPb_iff_forall_a_notPa_or_forall_b_notPb : forall (T : Type) (P Q : T->Prop),
(forall a b, P a \/ Q b) <-> ((forall a, P a) \/ (forall b, Q b))
.
Proof.
intros. split; intros.
- admit.
- destruct H; auto.
Admitted.
我很容易证明了一方,但找不到证明另一方的方法。 由于edestruct
,edestruct 对我不起作用。 我应该如何证明这个定理?
我相信这需要经典逻辑:
Require Import Coq.Logic.Classical.
Lemma forall_P_Q_a_b_notPa_or_notPb_iff_forall_a_notPa_or_forall_b_notPb : forall (T : Type) (P Q : T->Prop),
(forall a b, P a \/ Q b) <-> ((forall a, P a) \/ (forall b, Q b))
.
Proof.
intros T P Q. split; intros H.
- destruct (classic (forall a, P a)) as [HP|HP]; auto. (* Classical reasoning *)
destruct (not_all_ex_not _ _ HP) as [a Ha]. (* Also here *)
right; intros b.
specialize (H a b). tauto.
- destruct H; auto.
Qed.
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.