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	, , , ⊢
	: , :
1	theorem		⊢
	proveit.logic.equality.equals_reversal
2	instantiation	3, 28, 4, 5^, 6^	, , , ⊢
	: , : , :
3	theorem		⊢
	proveit.numbers.division.frac_cancel_right
4	instantiation	7, 14, 15	, , ⊢
	: , :
5	instantiation	8, 9, 10, 11, 12, 13, 14, 15, 25	, , , ⊢
	: , : , : , : , : , :
6	instantiation	16, 25, 17, 18^, 19^	⊢
	: , : , :
7	theorem		⊢
	proveit.numbers.multiplication.mult_complex_closure_bin
8	theorem		⊢
	proveit.numbers.multiplication.disassociation
9	axiom		⊢
	proveit.numbers.number_sets.natural_numbers.zero_in_nats
10	theorem		⊢
	proveit.numbers.numerals.decimals.nat2
11	theorem		⊢
	proveit.numbers.numerals.decimals.nat1
12	theorem		⊢
	proveit.core_expr_types.tuples.tuple_len_0_typical_eq
13	instantiation	20	⊢
	: , :
14	assumption		⊢
15	instantiation	21, 22, 23	, ⊢
	: , :
16	theorem		⊢
	proveit.numbers.exponentiation.product_of_posnat_powers
17	theorem		⊢
	proveit.numbers.numerals.decimals.posnat1
18	instantiation	24, 25	⊢
	:
19	theorem		⊢
	proveit.numbers.numerals.decimals.add_1_1
20	theorem		⊢
	proveit.numbers.numerals.decimals.tuple_len_2_typical_eq
21	theorem		⊢
	proveit.numbers.addition.add_complex_closure_bin
22	assumption		⊢
23	assumption		⊢
24	theorem		⊢
	proveit.numbers.exponentiation.complex_x_to_first_power_is_x
25	instantiation	26, 27, 28	⊢
	: , : , :
26	theorem		⊢
	proveit.logic.sets.inclusion.superset_membership_from_proper_subset
27	theorem		⊢
	proveit.numbers.number_sets.complex_numbers.complex_nonzero_within_complex
28	assumption		⊢
^*equality replacement requirements