let a, b be Integer; :: thesis: ( ( a <= b & b <= a + 1 ) iff ( b = a or b = a + 1 ) )
A1: ( a <= b & b <= a + 1 implies not not b = a + 0 & ... & not b = a + 1 ) by NAT162;
( ( b = a or b = a + 1 ) implies ( a <= b & b <= a + 1 ) )
proof
assume ( b = a or b = a + 1 ) ; :: thesis: ( a <= b & b <= a + 1 )
per cases then ( b = a or b = a + 1 ) ;
suppose C1: b = a ; :: thesis: ( a <= b & b <= a + 1 )
b + 0 < b + 1 by XREAL_1:6;
hence ( a <= b & b <= a + 1 ) by C1; :: thesis: verum
end;
suppose C1: b = a + 1 ; :: thesis: ( a <= b & b <= a + 1 )
a + 0 < a + 1 by XREAL_1:6;
hence ( a <= b & b <= a + 1 ) by C1; :: thesis: verum
end;
end;
end;
hence ( ( a <= b & b <= a + 1 ) iff ( b = a or b = a + 1 ) ) by A1; :: thesis: verum