THE CHOICE STRENGTH TABLE

not whether a theorem uses choice, but how much of it

“Depends on choice” is usually reported as one bit. set.mm declares three choice principles as separate axioms, so for this library it does not have to be.

Of 47,621 theorems, 1,528 reach one (3.21%). 583 need full choice. 879 need only countable choice. 66 need only dependent choice. The weaker principle carries more of the library than the strong one does.

Measured with gonzalgo · Metamath set.mm · proof closure of all 47,621 theorems against ax-ac, ax-ac2, ax-cc and ax-dc

theoremstrongest principle neededaxioms reached
1arithufdfull choiceax-ac2
1arithufdlem1full choiceax-ac2
1arithufdlem4full choiceax-ac2
2sqr3nconstrfull choiceax-ac2
abrexctffull choiceax-ac2
abrexdomfull choiceax-ac2
abrexdom2full choiceax-ac2
abrexdom2jmfull choiceax-ac2
abrexdomjmfull choiceax-ac2
ac2full choiceax-ac
ac3full choiceax-ac
ac4full choiceax-ac2
ac4cfull choiceax-ac2
ac5full choiceax-ac2
ac5bfull choiceax-ac2
ac6full choiceax-ac2
ac6c4full choiceax-ac2
ac6c5full choiceax-ac2
ac6gffull choiceax-ac2
ac6mapdfull choiceax-ac2
ac6nfull choiceax-ac2
ac6sfull choiceax-ac2
ac6s2full choiceax-ac2
ac6s3full choiceax-ac2
ac6s3ffull choiceax-ac2
ac6s4full choiceax-ac2
ac6s5full choiceax-ac2
ac6s6full choiceax-ac2
ac6s6ffull choiceax-ac2
ac6sffull choiceax-ac2
ac6sf2full choiceax-ac2
ac6sgfull choiceax-ac2
ac7full choiceax-ac2
ac7gfull choiceax-ac2
ac8full choiceax-ac2
ac8primfull choiceax-ac2
ac9full choiceax-ac2
ac9sfull choiceax-ac2
aciunf1full choiceax-ac2
aciunf1lemfull choiceax-ac2
ackmfull choiceax-ac2
acsdomdfull choiceax-ac2
acsexdimdfull choiceax-ac2
acsinfdfull choiceax-ac2
acsinfdimdfull choiceax-ac2
acsmap2dfull choiceax-ac2
acsmapdfull choiceax-ac2
acunirnmptfull choiceax-ac2
acunirnmpt2full choiceax-ac2
acunirnmpt2ffull choiceax-ac2
aeanfull choiceax-ac2
aleph1full choiceax-ac2
aleph1irrfull choiceax-ac2
aleph1refull choiceax-ac2
alephexp2full choiceax-ac2
alephomfull choiceax-ac2
alephregfull choiceax-ac2
alephsucpwfull choiceax-ac2
alephval2full choiceax-ac2
alexsubALTfull choiceax-ac2
alexsubALTlem2full choiceax-ac2
alexsubALTlem4full choiceax-ac2
algextdegfull choiceax-ac2
algextdeglem4full choiceax-ac2
algextdeglem6full choiceax-ac2
algextdeglem8full choiceax-ac2
assafldfull choiceax-ac2
assalactf1ofull choiceax-ac2
assarrginvfull choiceax-ac2
axacfull choiceax-ac2
axac10full choiceax-ac2
axac2full choiceax-ac
axac3full choiceax-ac2
axacifull choiceax-ac2
axacndfull choiceax-ac
axacndlem4full choiceax-ac
axacndlem5full choiceax-ac
axacprimfull choiceax-ac
axdcfull choiceax-ac2
axdclem2full choiceax-ac2
bayesthfull choiceax-ac2
bdayfinfull choiceax-ac2 ax-dc
bdayfinbndfull choiceax-ac2 ax-dc
bdayfinbndlem1full choiceax-ac2 ax-dc
bdayfinbndlem2full choiceax-ac2 ax-dc
bdayfinlemfull choiceax-ac2 ax-dc
bj-grur1full choiceax-ac2
bj-pwcfsdomfull choiceax-ac2
boolesineqfull choiceax-ac2
borelmblfull choiceax-ac2 ax-cc
bormflebmffull choiceax-ac2 ax-cc
brdom3full choiceax-ac2
brdom4full choiceax-ac2
brdom5full choiceax-ac2
brdom6disjfull choiceax-ac2
brdom7disjfull choiceax-ac2
canth3full choiceax-ac2
carageniunclfull choiceax-ac2
carageniuncllem2full choiceax-ac2
caragensalfull choiceax-ac2
caragenuniclfull choiceax-ac2
caratheodoryfull choiceax-ac2
caratheodorylem2full choiceax-ac2
carddomfull choiceax-ac2
cardenfull choiceax-ac2
cardeq0full choiceax-ac2
cardeqvfull choiceax-ac2
cardffull choiceax-ac2
cardidfull choiceax-ac2
cardiddfull choiceax-ac2
cardidgfull choiceax-ac2
cardminfull choiceax-ac2
cardsdomfull choiceax-ac2
cardvalfull choiceax-ac2
carsgclctunfull choiceax-ac2
carsgclctunlem2full choiceax-ac2
carsgclctunlem3full choiceax-ac2
carsgsigafull choiceax-ac2
ccfldextdgrrfull choiceax-ac2
cfpwsdomfull choiceax-ac2

Showing the first 120 of 1,528 rows. Grouped by principle, strongest first. The full set is in the JSON and the CSV.

strongest partitions these theorems: a theorem reaching full choice is counted there even if it also reaches the weaker principles. The raw memberships overlap and are in the data — 583 reach full choice, 1016 reach countable, 88 reach dependent, with 137 theorems in both full and countable alone.

Get the data

choice-strength.json · choice-strength.csv · CC-BY-4.0 · version 2026-08-12

One of the gonzalgo indexes — standing measurements of what formal libraries rest on, remeasured as the libraries move. Cite the series as 10.5281/zenodo.21900625, which resolves to the current deposit.

Reproduce it

pip install gonzalgo
gonzalgo mm set.mm

Method: 10.5281/zenodo.21769846.

The weaker axiom does more work

1016 theorems reach countable choice against 583 reaching choice proper. Countable choice is the weaker principle and it is load-bearing for more of this library, which is not what a single choice-dependence figure would suggest.

It also changes what a repair would mean. A theorem resting only on countable choice is already closer to a constructive setting than the same theorem resting on full choice, and reporting both as “classical” erases the distinction the database went to the trouble of making.

Why this differs from the Kernel Index figure

The Kernel Index reports set.mm at 1.22%, which is 583 theorems reaching full choice over 47,621. Counting every choice principle gives 1,528, or 3.21%. Neither number is wrong; they answer different questions, and this table is where the difference is visible rather than implicit.

Lean has no counterpart to this row. Classical.choice is a single axiom with no weaker sibling in the core, so a Lean library cannot be stratified this way at all — the distinction exists here because set.mm's authors declared the principles separately.