Show the Proof

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

	step type	requirements	statement
0	instantiation	1, 2, 3	⊢
	: , : , :
1	axiom		⊢
	proveit.numbers.ordering.transitivity_less_less
2	instantiation	4, 13, 5	⊢
	: , : , :
3	instantiation	31, 6, 7	⊢
	: , : , :
4	theorem		⊢
	proveit.numbers.ordering.transitivity_less_less_eq
5	instantiation	8, 60, 45, 35	⊢
	: , : , :
6	instantiation	9, 10, 11, 49, 12, 13	⊢
	: , : , :
7	instantiation	14, 15, 16	⊢
	: , : , :
8	theorem		⊢
	proveit.numbers.number_sets.integers.interval_lower_bound
9	theorem		⊢
	proveit.numbers.ordering.less_eq_add_right_strong
10	instantiation	66, 56, 17	⊢
	: , : , :
11	instantiation	66, 56, 18	⊢
	: , : , :
12	instantiation	19, 60, 45, 35	⊢
	: , : , :
13	theorem		⊢
	proveit.numbers.numerals.decimals.less_0_1
14	axiom		⊢
	proveit.logic.equality.equals_transitivity
15	instantiation	20, 23, 68, 63, 25, 21, 26, 43, 42	⊢
	: , : , : , : , : , :
16	instantiation	22, 63, 68, 23, 24, 25, 26, 43, 42, 27*	⊢
	: , : , : , : , : , :
17	instantiation	66, 61, 28	⊢
	: , : , :
18	instantiation	66, 61, 45	⊢
	: , : , :
19	theorem		⊢
	proveit.numbers.number_sets.integers.interval_upper_bound
20	theorem		⊢
	proveit.numbers.addition.disassociation
21	instantiation	29	⊢
	: , :
22	theorem		⊢
	proveit.numbers.addition.association
23	axiom		⊢
	proveit.numbers.number_sets.natural_numbers.zero_in_nats
24	instantiation	29	⊢
	: , :
25	theorem		⊢
	proveit.core_expr_types.tuples.tuple_len_0_typical_eq
26	instantiation	66, 50, 30	⊢
	: , : , :
27	instantiation	31, 32, 33	⊢
	: , : , :
28	instantiation	66, 34, 35	⊢
	: , : , :
29	theorem		⊢
	proveit.numbers.numerals.decimals.tuple_len_2_typical_eq
30	instantiation	36, 37, 59	⊢
	: , : , :
31	theorem		⊢
	proveit.logic.equality.sub_right_side_into
32	instantiation	38, 42, 39, 40	⊢
	: , : , :
33	instantiation	41, 42, 43	⊢
	: , :
34	instantiation	44, 60, 45	⊢
	: , :
35	assumption		⊢
36	theorem		⊢
	proveit.logic.sets.inclusion.unfold_subset_eq
37	instantiation	46, 47	⊢
	: , :
38	theorem		⊢
	proveit.numbers.addition.subtraction.subtract_from_add_reversed
39	instantiation	66, 50, 48	⊢
	: , : , :
40	theorem		⊢
	proveit.numbers.numerals.decimals.add_1_1
41	theorem		⊢
	proveit.numbers.addition.commutation
42	instantiation	66, 50, 49	⊢
	: , : , :
43	instantiation	66, 50, 51	⊢
	: , : , :
44	theorem		⊢
	proveit.numbers.number_sets.integers.int_interval_within_int
45	instantiation	52, 53, 62	⊢
	: , :
46	theorem		⊢
	proveit.logic.sets.inclusion.relax_proper_subset
47	theorem		⊢
	proveit.numbers.number_sets.real_numbers.nat_pos_within_real
48	instantiation	66, 56, 54	⊢
	: , : , :
49	instantiation	66, 56, 55	⊢
	: , : , :
50	theorem		⊢
	proveit.numbers.number_sets.complex_numbers.real_within_complex
51	instantiation	66, 56, 57	⊢
	: , : , :
52	theorem		⊢
	proveit.numbers.addition.add_int_closure_bin
53	instantiation	66, 58, 59	⊢
	: , : , :
54	instantiation	66, 61, 65	⊢
	: , : , :
55	instantiation	66, 61, 60	⊢
	: , : , :
56	theorem		⊢
	proveit.numbers.number_sets.real_numbers.rational_within_real
57	instantiation	66, 61, 62	⊢
	: , : , :
58	theorem		⊢
	proveit.numbers.number_sets.integers.nat_pos_within_int
59	theorem		⊢
	proveit.physics.quantum.QPE._two_pow_t_minus_one_is_nat_pos
60	instantiation	66, 67, 63	⊢
	: , : , :
61	theorem		⊢
	proveit.numbers.number_sets.rational_numbers.int_within_rational
62	instantiation	64, 65	⊢
	:
63	theorem		⊢
	proveit.numbers.numerals.decimals.nat1
64	theorem		⊢
	proveit.numbers.negation.int_closure
65	instantiation	66, 67, 68	⊢
	: , : , :
66	theorem		⊢
	proveit.logic.sets.inclusion.superset_membership_from_proper_subset
67	theorem		⊢
	proveit.numbers.number_sets.integers.nat_within_int
68	theorem		⊢
	proveit.numbers.numerals.decimals.nat2
*equality replacement requirements