Nuprl Lemma : fo-logic-test2
∀x:Dom. ((B x) 
⇒ (B x))
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])
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
apply: f a
Definitions unfolded in proof : 
language1: language1{i:l}(D,A,B,C,P,Q,R,H.fml[D;A;B;C;P;Q;R;H])
, 
uall: ∀[x:A]. B[x]
, 
!hyp_hide: x
, 
member: t ∈ T
, 
prop: ℙ
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
sqequalHypSubstitution, 
functionEquality, 
cumulativity, 
hypothesisEquality, 
universeEquality, 
because_Cache, 
lambdaFormation, 
applyEquality, 
hypothesis
Latex:
\mforall{}x:Dom.  ((B  x)  {}\mRightarrow{}  (B  x))
Date html generated:
2016_05_16-AM-09_08_05
Last ObjectModification:
2015_12_28-PM-07_03_03
Theory : first-order!and!ancestral!logic
Home
Index