Theorem: atleast_two_primes_in_range (RSAProject/ALITER_key_generator.lean)

State before:
⊢ 3 ∈ List.remove 2 (rangeFrom1ToN MAX)
Tactic:
rw[List.mem_remove_iff]
State after:
⊢ 3 ∈ rangeFrom1ToN MAX ∧ 3 ≠ 2

State before:
⊢ 3 ∈ rangeFrom1ToN MAX ∧ 3 ≠ 2
Tactic:
simp
State after:
no goals