Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Sets are complete characteristic-bit codes with actual finite cardinality witnesses. The proof constructs translations and the sumset; no finite-choice oracle, supplied cardinality conclusion, or unproved polynomial-method premise is used.
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ d. ∀ e. ∀ ab. ∀ ac. ∀ bb. ∀ bc. ∀ sb. ∀ sc. ∀ p. ∀ t. ∀ v. ¬p = 0 → t + v = p → ModularSetPullback(b,c,ab,ac,p,v) → ModularSetPullback(d,e,bb,bc,p,t) → ModularSetSumCover(b,c,d,e,sb,sc,p) → ModularSetSumCover(ab,ac,bb,bc,sb,sc,p)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 91 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
Named ingredients (3)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–20
03Fix variables and assumptionsL21–27
04Establish hAiffL28–37
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply finite modular pushforward membership witness.
- L28
have hAiff : (BetaAt(ab,ac,a,1) → ∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,x + t,a)) ∧ ((∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,x + t,a)) → BetaAt(ab,ac,a,1))Definitions: BetaAt(ab,ac,a,1)ModularSetMember(b,c,p,x)ModEq(p,x + t,a)Original native command in the exact edition - L29
specialize finite_modular_pushforward_membership_witness b - L30
specialize finite_modular_pushforward_membership_witness c - L31
specialize finite_modular_pushforward_membership_witness ab - L32
specialize finite_modular_pushforward_membership_witness ac - L33
specialize finite_modular_pushforward_membership_witness p - L34
specialize finite_modular_pushforward_membership_witness t - L35
specialize finite_modular_pushforward_membership_witness v - L36
specialize finite_modular_pushforward_membership_witness a - L37
apply finite_modular_pushforward_membership_witness
05Use earlier factsL38–41
06Separate the logical casesL42–42
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L42
cases hAiff
07Establish hBiffL43–52
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply finite modular pullback membership witness.
- L43
have hBiff : (BetaAt(bb,bc,z,1) → ∃ x. ModularSetMember(d,e,p,x) ∧ ModEq(p,z + t,x)) ∧ ((∃ x. ModularSetMember(d,e,p,x) ∧ ModEq(p,z + t,x)) → BetaAt(bb,bc,z,1))Definitions: BetaAt(bb,bc,z,1)ModularSetMember(d,e,p,x)ModEq(p,z + t,x)Original native command in the exact edition - L44
specialize finite_modular_pullback_membership_witness d - L45
specialize finite_modular_pullback_membership_witness e - L46
specialize finite_modular_pullback_membership_witness bb - L47
specialize finite_modular_pullback_membership_witness bc - L48
specialize finite_modular_pullback_membership_witness p - L49
specialize finite_modular_pullback_membership_witness t - L50
specialize finite_modular_pullback_membership_witness z - L51
apply finite_modular_pullback_membership_witness - L52
exact hp
08Use earlier factsL53–54
09Separate the logical casesL55–55
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L55
cases hBiff
10Establish hAsourceL56–58
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hAiff left.
- L56
have hAsource : ∃ j. ModularSetMember(b,c,p,j) ∧ ModEq(p,j + t,a)Definitions: ModularSetMember(b,c,p,j)ModEq(p,j + t,a)Original native command in the exact edition - L57
apply hAiff_left - L58
exact hA
11Separate the logical casesL59–61
12Establish hBsourceL62–64
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hBiff left.
- L62
have hBsource : ∃ j. ModularSetMember(d,e,p,j) ∧ ModEq(p,z + t,j)Definitions: ModularSetMember(d,e,p,j)ModEq(p,z + t,j)Original native command in the exact edition - L63
apply hBiff_left - L64
exact hB
13Separate the logical casesL65–67
14Use earlier factsL68–77
Instantiate or apply named facts and discharge the corresponding proof obligations.
15Use earlier factsL78–87
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L78
specialize mod_eq_trans x+x1 - L79
specialize mod_eq_trans a+z - L80
specialize mod_eq_trans w - L81
apply mod_eq_trans - L82
specialize finite_modular_shifted_sum_congruence p - L83
specialize finite_modular_shifted_sum_congruence x - L84
specialize finite_modular_shifted_sum_congruence x1 - L85
specialize finite_modular_shifted_sum_congruence a - L86
specialize finite_modular_shifted_sum_congruence z - L87
specialize finite_modular_shifted_sum_congruence t
Original defined command ledger · 91 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro e - 0005
intro ab - 0006
intro ac - 0007
intro bb - 0008
intro bc - 0009
intro sb - 0010
intro sc - 0011
intro p - 0012
intro t - 0013
intro v - 0014
intro hp - 0015
intro htv - 0016
intro hApull - 0017
intro hBpull - 0018
intro hcover - 0019
intro a - 0020
intro z - 0021
intro w - 0022
intro ha - 0023
intro hz - 0024
intro hw - 0025
intro hA - 0026
intro hB - 0027
intro hmod - 0028
have hAiff : (BetaAt(ab,ac,a,1) → ∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,x + t,a)) ∧ ((∃ x. ModularSetMember(b,c,p,x) ∧ ModEq(p,x + t,a)) → BetaAt(ab,ac,a,1)) - 0029
specialize finite_modular_pushforward_membership_witness b - 0030
specialize finite_modular_pushforward_membership_witness c - 0031
specialize finite_modular_pushforward_membership_witness ab - 0032
specialize finite_modular_pushforward_membership_witness ac - 0033
specialize finite_modular_pushforward_membership_witness p - 0034
specialize finite_modular_pushforward_membership_witness t - 0035
specialize finite_modular_pushforward_membership_witness v - 0036
specialize finite_modular_pushforward_membership_witness a - 0037
apply finite_modular_pushforward_membership_witness - 0038
exact hp - 0039
exact htv - 0040
exact hApull - 0041
exact ha - 0042
cases hAiff - 0043
have hBiff : (BetaAt(bb,bc,z,1) → ∃ x. ModularSetMember(d,e,p,x) ∧ ModEq(p,z + t,x)) ∧ ((∃ x. ModularSetMember(d,e,p,x) ∧ ModEq(p,z + t,x)) → BetaAt(bb,bc,z,1)) - 0044
specialize finite_modular_pullback_membership_witness d - 0045
specialize finite_modular_pullback_membership_witness e - 0046
specialize finite_modular_pullback_membership_witness bb - 0047
specialize finite_modular_pullback_membership_witness bc - 0048
specialize finite_modular_pullback_membership_witness p - 0049
specialize finite_modular_pullback_membership_witness t - 0050
specialize finite_modular_pullback_membership_witness z - 0051
apply finite_modular_pullback_membership_witness - 0052
exact hp - 0053
exact hBpull - 0054
exact hz - 0055
cases hBiff - 0056
have hAsource : ∃ j. ModularSetMember(b,c,p,j) ∧ ModEq(p,j + t,a) - 0057
apply hAiff_left - 0058
exact hA - 0059
cases hAsource - 0060
cases hAsource_witness - 0061
cases hAsource_witness_left - 0062
have hBsource : ∃ j. ModularSetMember(d,e,p,j) ∧ ModEq(p,z + t,j) - 0063
apply hBiff_left - 0064
exact hB - 0065
cases hBsource - 0066
cases hBsource_witness - 0067
cases hBsource_witness_left - 0068
specialize hcover x - 0069
specialize hcover x1 - 0070
specialize hcover w - 0071
apply hcover - 0072
exact hAsource_witness_left_left - 0073
exact hBsource_witness_left_left - 0074
exact hw - 0075
exact hAsource_witness_left_right - 0076
exact hBsource_witness_left_right - 0077
specialize mod_eq_trans p - 0078
specialize mod_eq_trans x+x1 - 0079
specialize mod_eq_trans a+z - 0080
specialize mod_eq_trans w - 0081
apply mod_eq_trans - 0082
specialize finite_modular_shifted_sum_congruence p - 0083
specialize finite_modular_shifted_sum_congruence x - 0084
specialize finite_modular_shifted_sum_congruence x1 - 0085
specialize finite_modular_shifted_sum_congruence a - 0086
specialize finite_modular_shifted_sum_congruence z - 0087
specialize finite_modular_shifted_sum_congruence t - 0088
apply finite_modular_shifted_sum_congruence - 0089
exact hAsource_witness_right - 0090
exact hBsource_witness_right - 0091
exact hmod