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
forall a b c d e f g h. (((((a * e) * (b * f + c * g + d * h) + (b * f + c * g + d * h) * (a * e)) + ((a * f + b * e + c * h) * (d * g) + (d * g) * (a * f + b * e + c * h))) + (((a * g + c * e + d * f) * (b * h) + (b * h) * (a * g + c * e + d * f)) + ((a * h + b * g + d * e) * (c * f) + (c * f) * (a * h + b * g + d * e))))) = ((((((((((a * e) * (b * f)) + ((b * f) * (a * e)))) + ((((a * e) * (c * g)) + ((c * g) * (a * e))))) + ((((a * e) * (d * h)) + ((d * h) * (a * e)))))) + (((((((a * f) * (d * g)) + ((d * g) * (a * f)))) + ((((b * e) * (d * g)) + ((d * g) * (b * e))))) + ((((c * h) * (d * g)) + ((d * g) * (c * h))))))) + ((((((((a * g) * (b * h)) + ((b * h) * (a * g)))) + ((((b * h) * (c * e)) + ((c * e) * (b * h))))) + ((((b * h) * (d * f)) + ((d * f) * (b * h)))))) + (((((((a * h) * (c * f)) + ((c * f) * (a * h)))) + ((((b * g) * (c * f)) + ((c * f) * (b * g))))) + ((((c * f) * (d * e)) + ((d * e) * (c * f)))))))))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 e f g h. (((((a * e) * (b * f + c * g + d * h) + (b * f + c * g + d * h) * (a * e)) + ((a * f + b * e + c * h) * (d * g) + (d * g) * (a * f + b * e + c * h))) + (((a * g + c * e + d * f) * (b * h) + (b * h) * (a * g + c * e + d * f)) + ((a * h + b * g + d * e) * (c * f) + (c * f) * (a * h + b * g + d * e))))) = ((((((((((a * e) * (b * f)) + ((b * f) * (a * e)))) + ((((a * e) * (c * g)) + ((c * g) * (a * e))))) + ((((a * e) * (d * h)) + ((d * h) * (a * e)))))) + (((((((a * f) * (d * g)) + ((d * g) * (a * f)))) + ((((b * e) * (d * g)) + ((d * g) * (b * e))))) + ((((c * h) * (d * g)) + ((d * g) * (c * h))))))) + ((((((((a * g) * (b * h)) + ((b * h) * (a * g)))) + ((((b * h) * (c * e)) + ((c * e) * (b * h))))) + ((((b * h) * (d * f)) + ((d * f) * (b * h)))))) + (((((((a * h) * (c * f)) + ((c * f) * (a * h)))) + ((((b * g) * (c * f)) + ((c * f) * (b * g))))) + ((((c * f) * (d * e)) + ((d * e) * (c * f)))))))))Proof neighborhood
Direct theorem prerequisites
FS002P four_square_euler_cross_triple_expansion add_comm · Stable closedDirect 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.
Named ingredients (1)
01Fix variables and assumptionsL1–8
02Calculate and transport equalitiesL9–11
03Use earlier factsL12–12
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L12
apply four_square_euler_cross_triple_expansion
04Calculate and transport equalitiesL13–18
05Use earlier factsL19–19
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L19
apply add_comm
06Calculate and transport equalitiesL20–20
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L20
trans ((((((d * g) * (a * f)) + ((a * f) * (d * g)))) + ((((d * g) * (b * e)) + ((b * e) * (d * g))))) + ((((d * g) * (c * h)) + ((c * h) * (d * g)))))
07Use earlier factsL21–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
apply four_square_euler_cross_triple_expansion
08Calculate and transport equalitiesL22–23
09Use earlier factsL24–26
10Calculate and transport equalitiesL27–28
11Use earlier factsL29–29
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L29
apply add_comm
12Calculate and transport equalitiesL30–30
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L30
trans ((((((b * h) * (a * g)) + ((a * g) * (b * h)))) + ((((b * h) * (c * e)) + ((c * e) * (b * h))))) + ((((b * h) * (d * f)) + ((d * f) * (b * h)))))
13Use earlier factsL31–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L31
apply four_square_euler_cross_triple_expansion
14Calculate and transport equalitiesL32–33
15Use earlier factsL34–34
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L34
apply add_comm
16Calculate and transport equalitiesL35–37
17Use earlier factsL38–38
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
apply add_comm
18Calculate and transport equalitiesL39–39
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L39
trans ((((((c * f) * (a * h)) + ((a * h) * (c * f)))) + ((((c * f) * (b * g)) + ((b * g) * (c * f))))) + ((((c * f) * (d * e)) + ((d * e) * (c * f)))))
19Use earlier factsL40–40
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L40
apply four_square_euler_cross_triple_expansion
20Calculate and transport equalitiesL41–42
21Use earlier factsL43–44
22Calculate and transport equalitiesL45–45
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L45
refl
Original defined command ledger · 45 lines
- 0001
intro a - 0002
intro b - 0003
intro c - 0004
intro d - 0005
intro e - 0006
intro f - 0007
intro g - 0008
intro h - 0009
congr - 0010
congr - 0011
trans ((((((a * e) * (b * f)) + ((b * f) * (a * e)))) + ((((a * e) * (c * g)) + ((c * g) * (a * e))))) + ((((a * e) * (d * h)) + ((d * h) * (a * e))))) - 0012
apply four_square_euler_cross_triple_expansion - 0013
congr - 0014
congr - 0015
refl - 0016
refl - 0017
refl - 0018
trans (d * g) * ((((a * f) + (b * e)) + (c * h))) + ((((a * f) + (b * e)) + (c * h))) * (d * g) - 0019
apply add_comm - 0020
trans ((((((d * g) * (a * f)) + ((a * f) * (d * g)))) + ((((d * g) * (b * e)) + ((b * e) * (d * g))))) + ((((d * g) * (c * h)) + ((c * h) * (d * g))))) - 0021
apply four_square_euler_cross_triple_expansion - 0022
congr - 0023
congr - 0024
apply add_comm - 0025
apply add_comm - 0026
apply add_comm - 0027
congr - 0028
trans (b * h) * ((((a * g) + (c * e)) + (d * f))) + ((((a * g) + (c * e)) + (d * f))) * (b * h) - 0029
apply add_comm - 0030
trans ((((((b * h) * (a * g)) + ((a * g) * (b * h)))) + ((((b * h) * (c * e)) + ((c * e) * (b * h))))) + ((((b * h) * (d * f)) + ((d * f) * (b * h))))) - 0031
apply four_square_euler_cross_triple_expansion - 0032
congr - 0033
congr - 0034
apply add_comm - 0035
refl - 0036
refl - 0037
trans (c * f) * ((((a * h) + (b * g)) + (d * e))) + ((((a * h) + (b * g)) + (d * e))) * (c * f) - 0038
apply add_comm - 0039
trans ((((((c * f) * (a * h)) + ((a * h) * (c * f)))) + ((((c * f) * (b * g)) + ((b * g) * (c * f))))) + ((((c * f) * (d * e)) + ((d * e) * (c * f))))) - 0040
apply four_square_euler_cross_triple_expansion - 0041
congr - 0042
congr - 0043
apply add_comm - 0044
apply add_comm - 0045
refl