Nuprl Lemma : pv11_p1_leq_bnum_or
∀ldrs_uid:Id ─→ ℤ. ∀b1,b2:pv11_p1_Ballot_Num().
  ((↑(pv11_p1_leq_bnum(ldrs_uid) b1 b2)) ∨ (↑(pv11_p1_leq_bnum(ldrs_uid) b2 b1)))
Proof
Definitions occuring in Statement : 
pv11_p1_leq_bnum: pv11_p1_leq_bnum(ldrs_uid)
, 
pv11_p1_Ballot_Num: pv11_p1_Ballot_Num()
, 
Id: Id
, 
assert: ↑b
, 
all: ∀x:A. B[x]
, 
or: P ∨ Q
, 
apply: f a
, 
function: x:A ─→ B[x]
, 
int: ℤ
Lemmas : 
lt_int_wf, 
bool_wf, 
eqtt_to_assert, 
assert_of_lt_int, 
assert_wf, 
bor_wf, 
eq_int_wf, 
assert_of_eq_int, 
le_int_wf, 
eqff_to_assert, 
equal_wf, 
bool_cases_sqequal, 
subtype_base_sq, 
bool_subtype_base, 
assert-bnot, 
less_than_wf, 
assert_of_le_int, 
le_wf, 
iff_transitivity, 
or_wf, 
equal-wf-base, 
iff_weakening_uiff, 
assert_of_bor, 
assert_of_band, 
decidable__le, 
false_wf, 
not-le-2, 
condition-implies-le, 
minus-add, 
minus-one-mul, 
add-swap, 
add-commutes, 
add_functionality_wrt_le, 
add-associates, 
le-add-cancel, 
neg_assert_of_eq_int, 
int_subtype_base, 
decidable__lt, 
not-equal-2, 
true_wf, 
pv11_p1_Ballot_Num_wf, 
Id_wf
Latex:
\mforall{}ldrs$_{uid}$:Id  {}\mrightarrow{}  \mBbbZ{}.  \mforall{}b1,b2:pv11\_p1\_Ballot\_Num().
    ((\muparrow{}(pv11\_p1\_leq\_bnum(ldrs$_{uid}$)  b1  b2))  \mvee{}  (\muparrow{}(pv11\_p1\_leq\_bnum(ldrs$\mbackslash{}ff5\000Cf{uid}$)  b2  b1)))
Date html generated:
2015_07_23-PM-04_44_13
Last ObjectModification:
2015_01_29-AM-11_20_41
Home
Index