Nuprl Lemma : decidable__equal_unit

x,y:Unit.  Dec(x y ∈ Unit)


Proof




Definitions occuring in Statement :  decidable: Dec(P) all: x:A. B[x] unit: Unit equal: t ∈ T
Definitions unfolded in proof :  all: x:A. B[x] decidable: Dec(P) or: P ∨ Q uall: [x:A]. B[x] member: t ∈ T prop:
Lemmas referenced :  unit_wf equal_wf not_wf equal-unit
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity lambdaFormation inlFormation cut lemma_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality hypothesis

Latex:
\mforall{}x,y:Unit.    Dec(x  =  y)



Date html generated: 2016_05_13-PM-03_18_01
Last ObjectModification: 2016_01_06-PM-05_20_22

Theory : core_2


Home Index