FormalConjectures/ErdosProblems/486.lean

GitHub source file

1 declarations, 1 contain sorry, 0 declared as axioms

Erdős Problem 486: Logarithmic density for sets avoiding modular subsets

References:

Imports (1)
  1. theorem Erdos486.erdos_486 sorry line 54 source

    depends on sorry what this means

    Statement uses: Iff, False, Nat, Set, ZMod, Exists, Real, Set.HasLogDensity, Set.ofPred, LT.lt, OfNat.ofNat, Not, Membership.mem

    Proof uses: sorryAx, Lean.Name, Bool.false, Lean.Name.num, Lean.Name.str, Lean.Name.anonymous

    18 instances, coercions and auxiliary constants left out.

    Tactic trace: 1 steps

    Open to load the checked before-and-after goal states.