Exact expanded PA statement
forall x e k. (((exists bcs_lower_gap_shift_source. bcs_lower_gap_shift_source + (x) = 6 * (e)) /\ exists bcs_upper_gap_shift_source. bcs_upper_gap_shift_source + S (6 * (e)) = (x) + 6)) -> (((exists bcs_lower_gap_shift_target. bcs_lower_gap_shift_target + (x + 6 * k) = 6 * (e + k)) /\ exists bcs_upper_gap_shift_target. bcs_upper_gap_shift_target + S (6 * (e + k)) = (x + 6 * k) + 6))Structural proof guide
Ceiling by six commutes with adding an explicit multiple of six.
Direct prerequisites: mul_add, add_assoc, add_comm, add_succ_left. The authored body proceeds by case analysis (3), intermediate claims (1), equality transport (4).
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.
- 0001
intro x - 0002
intro e - 0003
intro k - 0004
intro h - 0005
have hmul : 6 * (e + k) = 6 * e + 6 * k - 0006
specialize mul_add 6 - 0007
specialize mul_add e - 0008
specialize mul_add k - 0009
exact mul_add - 0010
cases h - 0011
split - 0012
cases h_left - 0013
exists x1 - 0014
rewrite hmul - 0015
trans (x1 + x) + 6 * k - 0016
symm - 0017
apply add_assoc - 0018
rewrite h_left_witness - 0019
refl - 0020
cases h_right - 0021
exists x1 - 0022
rewrite hmul - 0023
trans x1 + (S (6 * e) + 6 * k) - 0024
congr - 0025
refl - 0026
symm - 0027
apply add_succ_left - 0028
trans (x1 + S (6 * e)) + 6 * k - 0029
symm - 0030
apply add_assoc - 0031
rewrite h_right_witness - 0032
trans x + (6 + 6 * k) - 0033
apply add_assoc - 0034
trans x + (6 * k + 6) - 0035
congr - 0036
refl - 0037
apply add_comm - 0038
symm - 0039
apply add_assoc