OAI/Analysis/PureInfiniteness/CountableUltrapowerSaturation.lean

GitHub source file

1 declarations, 0 contain sorry, 0 declared as axioms

Countably many polynomial conditions with one uniform norm bound.

  1. theorem OAI.NormUltra.bounded_epsilon_test_countable line 15