Nuprl Lemma : example2
∀x.(B x) ⇒ (C x) ⇒ ∃z.B z ⇒ ∃y.C y
Proof
Definitions occuring in Statement :
language1: language1{i:l}(D,A,B,C,P,Q,R,H.fml[D;A;B;C;P;Q;R;H]),
forsome: ∃x.P[x],
forall: ∀x.P[x],
implies: P ⇒ Q,
apply: f a
Lemmas :
forsome_wf,
forall_wf
\mforall{}x.(B x) {}\mRightarrow{} (C x) {}\mRightarrow{} \mexists{}z.B z {}\mRightarrow{} \mexists{}y.C y
Date html generated:
2015_07_17-AM-07_52_42
Last ObjectModification:
2015_01_30-AM-01_13_13
Home
Index