Proof of proveit.numbers.numerals.decimals.deci_sequence_reduction theorem

import proveit
from proveit import defaults
from proveit.numbers.numerals import DecimalSequence
theory = proveit.Theory() # the theorem's theory

%proving deci_sequence_reduction

With these allowed/disallowed theorem/theory presumptions (e.g., to avoid circular dependencies), we begin our proof of
deci_sequence_reduction:
(see dependencies)

defaults.assumptions = deci_sequence_reduction.all_conditions()

defaults.assumptions:

equality = defaults.assumptions[-1]

equality:

lhs = deci_sequence_reduction.instance_expr.instance_expr.lhs

lhs:

rhs = deci_sequence_reduction.instance_expr.instance_expr.rhs

rhs:

equality.substitution(lhs.inner_expr().operands[1])

 ⊢  

deci_sequence_reduction may now be readily provable (assuming required theorems are usable).  Simply execute "%qed".

%qed

proveit.numbers.numerals.decimals.deci_sequence_reduction has been proven.

	step type	requirements	statement
0	generalization	1	⊢
1	instantiation	2, 3	⊢
	: , : , :
2	axiom		⊢
	proveit.logic.equality.substitution
3	assumption		⊢