Nuprl Lemma : uimplies_functionality_wrt_uiff2
∀[P,Q1,Q2:ℙ].  ({uiff(Q1;Q2)} 
⇒ {uiff(Q1 supposing P;Q2 supposing P)})
Proof
Definitions occuring in Statement : 
uiff: uiff(P;Q)
, 
uimplies: b supposing a
, 
uall: ∀[x:A]. B[x]
, 
prop: ℙ
, 
guard: {T}
, 
implies: P 
⇒ Q
Definitions unfolded in proof : 
guard: {T}
, 
uall: ∀[x:A]. B[x]
, 
implies: P 
⇒ Q
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
uimplies: b supposing a
, 
prop: ℙ
, 
member: t ∈ T
Lemmas referenced : 
uiff_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalRule, 
sqequalReflexivity, 
sqequalTransitivity, 
computationStep, 
Error :isect_memberFormation_alt, 
lambdaFormation, 
sqequalHypSubstitution, 
productElimination, 
thin, 
independent_pairFormation, 
cut, 
hypothesis, 
independent_isectElimination, 
Error :universeIsType, 
hypothesisEquality, 
Error :isectIsType, 
because_Cache, 
introduction, 
extract_by_obid, 
isectElimination, 
Error :inhabitedIsType, 
universeEquality
Latex:
\mforall{}[P,Q1,Q2:\mBbbP{}].    (\{uiff(Q1;Q2)\}  {}\mRightarrow{}  \{uiff(Q1  supposing  P;Q2  supposing  P)\})
Date html generated:
2019_06_20-AM-11_17_31
Last ObjectModification:
2018_09_26-AM-10_25_50
Theory : core_2
Home
Index