Show the Proof¶

In [1]:

import proveit
# Automation is not needed when only showing a stored proof:
proveit.defaults.automation = False # This will speed things up.
proveit.defaults.inline_pngs = False # Makes files smaller.
%show_proof

Out[1]:

	step type	requirements	statement
0	instantiation	1, 2, 3, 4	⊢
	: , : , :
1	theorem		⊢
	proveit.numbers.number_sets.integers.interval_upper_bound
2	instantiation	18, 5, 6	⊢
	: , :
3	reference	8	⊢
4	assumption		⊢
5	instantiation	7, 8	⊢
	:
6	instantiation	24, 9, 10	⊢
	: , : , :
7	theorem		⊢
	proveit.numbers.negation.int_closure
8	instantiation	24, 23, 11	⊢
	: , : , :
9	theorem		⊢
	proveit.numbers.number_sets.integers.nat_within_int
10	theorem		⊢
	proveit.numbers.numerals.decimals.nat1
11	instantiation	12, 13, 14	⊢
	: , :
12	theorem		⊢
	proveit.numbers.exponentiation.exp_natpos_closure
13	theorem		⊢
	proveit.numbers.numerals.decimals.nat2
14	instantiation	15, 16, 17	⊢
	:
15	theorem		⊢
	proveit.numbers.number_sets.integers.nonneg_int_is_natural
16	instantiation	18, 19, 20	⊢
	: , :
17	instantiation	21, 22	⊢
	: , :
18	theorem		⊢
	proveit.numbers.addition.add_int_closure_bin
19	instantiation	24, 23, 28	⊢
	: , : , :
20	instantiation	24, 25, 26	⊢
	: , : , :
21	theorem		⊢
	proveit.numbers.addition.subtraction.nonneg_difference
22	instantiation	27, 28	⊢
	:
23	theorem		⊢
	proveit.numbers.number_sets.integers.nat_pos_within_int
24	theorem		⊢
	proveit.logic.sets.inclusion.superset_membership_from_proper_subset
25	theorem		⊢
	proveit.numbers.number_sets.integers.neg_int_within_int
26	instantiation	29, 30	⊢
	:
27	theorem		⊢
	proveit.numbers.number_sets.natural_numbers.natural_pos_lower_bound
28	axiom		⊢
	proveit.physics.quantum.QPE._t_in_natural_pos
29	theorem		⊢
	proveit.numbers.negation.int_neg_closure
30	theorem		⊢
	proveit.numbers.numerals.decimals.posnat1