Nuprl Lemma : rmax-com

[x,y:ℝ].  (rmax(x;y) rmax(y;x))


Proof




Definitions occuring in Statement :  rmax: rmax(x;y) req: y real: uall: [x:A]. B[x]
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a real: squash: T rmax: rmax(x;y) prop: true: True subtype_rel: A ⊆B guard: {T} iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q implies:  Q
Lemmas referenced :  req_weakening rmax_wf equal_wf squash_wf true_wf imax_com imax_wf iff_weakening_equal nat_plus_wf regular-int-seq_wf req_witness real_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality hypothesis independent_isectElimination because_Cache applyLambdaEquality setElimination rename sqequalRule imageMemberEquality baseClosed imageElimination dependent_set_memberEquality functionExtensionality applyEquality lambdaEquality equalityTransitivity equalitySymmetry universeEquality intEquality natural_numberEquality productElimination independent_functionElimination isect_memberEquality

Latex:
\mforall{}[x,y:\mBbbR{}].    (rmax(x;y)  =  rmax(y;x))



Date html generated: 2017_10_03-AM-08_22_10
Last ObjectModification: 2017_07_28-AM-07_22_11

Theory : reals


Home Index