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.
Statement with defined notation
∀ a. ∀ b. ∀ c. ∀ d. Odd(a + b) → Odd(c + d) → (Even(a) ∧ Even(c) ∨ Odd(a) ∧ Odd(c)) ∧ (Even(b) ∧ Even(d) ∨ Odd(b) ∧ Odd(d)) ∨ (Even(a) ∧ Even(d) ∨ Odd(a) ∧ Odd(d)) ∧ (Even(b) ∧ Even(c) ∨ Odd(b) ∧ Odd(c))Every purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall a b c d. (exists fsps_odd_odd_first. (a + b) = 2 * fsps_odd_odd_first + 1) -> (exists fsps_odd_odd_second. (c + d) = 2 * fsps_odd_odd_second + 1) -> (((((((exists fsd_even_first_fsps_odd_blocks_ac. a = 2 * fsd_even_first_fsps_odd_blocks_ac) /\ (exists fsd_even_second_fsps_odd_blocks_ac. c = 2 * fsd_even_second_fsps_odd_blocks_ac)) \/ ((exists fsd_odd_first_fsps_odd_blocks_ac. a = 2 * fsd_odd_first_fsps_odd_blocks_ac + 1) /\ (exists fsd_odd_second_fsps_odd_blocks_ac. c = 2 * fsd_odd_second_fsps_odd_blocks_ac + 1)))) /\ ((((exists fsd_even_first_fsps_odd_blocks_bd. b = 2 * fsd_even_first_fsps_odd_blocks_bd) /\ (exists fsd_even_second_fsps_odd_blocks_bd. d = 2 * fsd_even_second_fsps_odd_blocks_bd)) \/ ((exists fsd_odd_first_fsps_odd_blocks_bd. b = 2 * fsd_odd_first_fsps_odd_blocks_bd + 1) /\ (exists fsd_odd_second_fsps_odd_blocks_bd. d = 2 * fsd_odd_second_fsps_odd_blocks_bd + 1))))) \/ (((((exists fsd_even_first_fsps_odd_blocks_ad. a = 2 * fsd_even_first_fsps_odd_blocks_ad) /\ (exists fsd_even_second_fsps_odd_blocks_ad. d = 2 * fsd_even_second_fsps_odd_blocks_ad)) \/ ((exists fsd_odd_first_fsps_odd_blocks_ad. a = 2 * fsd_odd_first_fsps_odd_blocks_ad + 1) /\ (exists fsd_odd_second_fsps_odd_blocks_ad. d = 2 * fsd_odd_second_fsps_odd_blocks_ad + 1)))) /\ ((((exists fsd_even_first_fsps_odd_blocks_bc. b = 2 * fsd_even_first_fsps_odd_blocks_bc) /\ (exists fsd_even_second_fsps_odd_blocks_bc. c = 2 * fsd_even_second_fsps_odd_blocks_bc)) \/ ((exists fsd_odd_first_fsps_odd_blocks_bc. b = 2 * fsd_odd_first_fsps_odd_blocks_bc + 1) /\ (exists fsd_odd_second_fsps_odd_blocks_bc. c = 2 * fsd_odd_second_fsps_odd_blocks_bc + 1)))))))Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
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.
01Fix variables and assumptionsL1–6
02Establish hfirstL7–11
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply odd sum parity cases.
03Establish hsecondL12–14
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply odd sum parity cases.
04Separate the logical casesL15–22
05Use earlier factsL23–24
06Separate the logical casesL25–26
07Use earlier factsL27–28
08Separate the logical casesL29–33
09Use earlier factsL34–35
10Separate the logical casesL36–37
11Use earlier factsL38–39
12Separate the logical casesL40–46
13Use earlier factsL47–48
14Separate the logical casesL49–50
15Use earlier factsL51–52
16Separate the logical casesL53–57
17Use earlier factsL58–59
18Separate the logical casesL60–61
Original defined command ledger · 63 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro d - 0005
intro hfirst_odd - 0006
intro hsecond_odd - 0007
have hfirst : Even(a) ∧ Odd(b) ∨ Odd(a) ∧ Even(b)Exact native replay line
have hfirst : (((exists fsps_even_first_a_even. (a) = 2 * fsps_even_first_a_even) /\ (exists fsps_odd_first_b_odd. (b) = 2 * fsps_odd_first_b_odd + 1)) \/ ((exists fsps_odd_first_a_odd. (a) = 2 * fsps_odd_first_a_odd + 1) /\ (exists fsps_even_first_b_even. (b) = 2 * fsps_even_first_b_even))) - 0008
specialize odd_sum_parity_cases a - 0009
specialize odd_sum_parity_cases b - 0010
apply odd_sum_parity_cases - 0011
exact hfirst_odd - 0012
have hsecond : Even(c) ∧ Odd(d) ∨ Odd(c) ∧ Even(d)Exact native replay line
have hsecond : (((exists fsps_even_second_c_even. (c) = 2 * fsps_even_second_c_even) /\ (exists fsps_odd_second_d_odd. (d) = 2 * fsps_odd_second_d_odd + 1)) \/ ((exists fsps_odd_second_c_odd. (c) = 2 * fsps_odd_second_c_odd + 1) /\ (exists fsps_even_second_d_even. (d) = 2 * fsps_even_second_d_even))) - 0013
apply odd_sum_parity_cases - 0014
exact hsecond_odd - 0015
cases hfirst - 0016
cases hfirst_left - 0017
cases hsecond - 0018
cases hsecond_left - 0019
left - 0020
split - 0021
left - 0022
split - 0023
exact hfirst_left_left - 0024
exact hsecond_left_left - 0025
right - 0026
split - 0027
exact hfirst_left_right - 0028
exact hsecond_left_right - 0029
cases hsecond_right - 0030
right - 0031
split - 0032
left - 0033
split - 0034
exact hfirst_left_left - 0035
exact hsecond_right_right - 0036
right - 0037
split - 0038
exact hfirst_left_right - 0039
exact hsecond_right_left - 0040
cases hfirst_right - 0041
cases hsecond - 0042
cases hsecond_left - 0043
right - 0044
split - 0045
right - 0046
split - 0047
exact hfirst_right_left - 0048
exact hsecond_left_right - 0049
left - 0050
split - 0051
exact hfirst_right_right - 0052
exact hsecond_left_left - 0053
cases hsecond_right - 0054
left - 0055
split - 0056
right - 0057
split - 0058
exact hfirst_right_left - 0059
exact hsecond_right_left - 0060
left - 0061
split - 0062
exact hfirst_right_right - 0063
exact hsecond_right_right