Nuprl Lemma : grp_le_wf

[g:GrpSig]. (≤b ∈ |g| ⟶ |g| ⟶ 𝔹)


Proof




Definitions occuring in Statement :  grp_le: b grp_car: |g| grp_sig: GrpSig bool: 𝔹 uall: [x:A]. B[x] member: t ∈ T function: x:A ⟶ B[x]
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T grp_sig: GrpSig grp_le: b grp_car: |g| pi1: fst(t) pi2: snd(t)
Lemmas referenced :  grp_sig_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalHypSubstitution productElimination thin sqequalRule hypothesisEquality hypothesis axiomEquality equalityTransitivity equalitySymmetry lemma_by_obid

Latex:
\mforall{}[g:GrpSig].  (\mleq{}\msubb{}  \mmember{}  |g|  {}\mrightarrow{}  |g|  {}\mrightarrow{}  \mBbbB{})



Date html generated: 2016_05_15-PM-00_06_18
Last ObjectModification: 2015_12_26-PM-11_47_30

Theory : groups_1


Home Index