Nuprl Lemma : req*_transitivity

∀[x,y,z:ℝ*].  (x = y ⇒ y = z ⇒ x = z)


Proof




Definitions occuring in Statement :  req*: x = y,  real*: ℝ*,  uall: ∀[x:A]. B[x],  implies: P ⇒ Q
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  implies: P ⇒ Q,  req*: x = y,  exists: ∃x:A. B[x],  member: t ∈ T,  nat: ℕ,  all: ∀x:A. B[x],  guard: {T},  ge: i ≥ j ,  decidable: Dec(P),  or: P ∨ Q,  uimplies: b supposing a,  not: ¬A,  satisfiable_int_formula: satisfiable_int_formula(fmla),  false: False,  top: Top,  and: P ∧ Q,  prop: ℙ,  real*: ℝ*,  subtype_rel: A ⊆r B,  so_lambda: λ2x.t[x],  so_apply: x[s],  int_upper: {i...},  iff: P ⇐⇒ Q,  rev_implies: P ⇐ Q,  uiff: uiff(P;Q),  rev_uimplies: rev_uimplies(P;Q)
Lemmas referenced :  imax_wf,  imax_nat,  nat_wf,  nat_properties,  decidable__le,  full-omega-unsat,  intformand_wf,  intformnot_wf,  intformle_wf,  itermConstant_wf,  itermVar_wf,  intformeq_wf,  int_formula_prop_and_lemma,  int_formula_prop_not_lemma,  int_formula_prop_le_lemma,  int_term_value_constant_lemma,  int_term_value_var_lemma,  int_formula_prop_eq_lemma,  int_formula_prop_wf,  equal_wf,  le_wf,  req_witness,  int_upper_subtype_nat,  int_upper_wf,  all_wf,  req_wf,  req*_wf,  real*_wf,  int_upper_properties,  int_upper_subtype_int_upper,  imax_ub,  req_functionality,  req_weakening
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation,  lambdaFormation,  sqequalHypSubstitution,  productElimination,  thin,  dependent_pairFormation,  dependent_set_memberEquality,  cut,  introduction,  extract_by_obid,  isectElimination,  setElimination,  rename,  hypothesisEquality,  hypothesis,  equalityTransitivity,  equalitySymmetry,  applyLambdaEquality,  dependent_functionElimination,  natural_numberEquality,  unionElimination,  independent_isectElimination,  approximateComputation,  independent_functionElimination,  lambdaEquality,  int_eqEquality,  intEquality,  isect_memberEquality,  voidElimination,  voidEquality,  sqequalRule,  independent_pairFormation,  applyEquality,  because_Cache,  inlFormation,  inrFormation

Latex:
\mforall{}[x,y,z:\mBbbR{}*].    (x  =  y  {}\mRightarrow{}  y  =  z  {}\mRightarrow{}  x  =  z)



Date html generated: 2018_05_22-PM-03_14_28
Last ObjectModification: 2017_10_06-PM-02_03_25

Theory : reals_2


Home Index