Metamath Proof Explorer


Theorem ppisval

Description: The set of primes less than A expressed using a finite set of integers. (Contributed by Mario Carneiro, 22-Sep-2014)

Ref Expression
Assertion ppisval ⊢ A ∈ ℝ → 0 A ∩ ℙ = 2 … A ∩ ℙ

Proof

Step Hyp Ref Expression
1 simpr ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ 0 A ∩ ℙ
2 1 elin2d ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ ℙ
3 prmuz2 ⊢ x ∈ ℙ → x ∈ ℤ ≥ 2
4 2 3 syl ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ ℤ ≥ 2
5 prmz ⊢ x ∈ ℙ → x ∈ ℤ
6 2 5 syl ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ ℤ
7 flcl ⊢ A ∈ ℝ → A ∈ ℤ
8 7 adantr ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → A ∈ ℤ
9 1 elin1d ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ 0 A
10 0re ⊢ 0 ∈ ℝ
11 simpl ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → A ∈ ℝ
12 elicc2 ⊢ 0 ∈ ℝ ∧ A ∈ ℝ → x ∈ 0 A ↔ x ∈ ℝ ∧ 0 ≤ x ∧ x ≤ A
13 10 11 12 sylancr ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ 0 A ↔ x ∈ ℝ ∧ 0 ≤ x ∧ x ≤ A
14 9 13 mpbid ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ ℝ ∧ 0 ≤ x ∧ x ≤ A
15 14 simp3d ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ≤ A
16 flge ⊢ A ∈ ℝ ∧ x ∈ ℤ → x ≤ A ↔ x ≤ A
17 6 16 syldan ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ≤ A ↔ x ≤ A
18 15 17 mpbid ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ≤ A
19 eluz2 ⊢ A ∈ ℤ ≥ x ↔ x ∈ ℤ ∧ A ∈ ℤ ∧ x ≤ A
20 6 8 18 19 syl3anbrc ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → A ∈ ℤ ≥ x
21 elfzuzb ⊢ x ∈ 2 … A ↔ x ∈ ℤ ≥ 2 ∧ A ∈ ℤ ≥ x
22 4 20 21 sylanbrc ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ 2 … A
23 22 2 elind ⊢ A ∈ ℝ ∧ x ∈ 0 A ∩ ℙ → x ∈ 2 … A ∩ ℙ
24 23 ex ⊢ A ∈ ℝ → x ∈ 0 A ∩ ℙ → x ∈ 2 … A ∩ ℙ
25 24 ssrdv ⊢ A ∈ ℝ → 0 A ∩ ℙ ⊆ 2 … A ∩ ℙ
26 2z ⊢ 2 ∈ ℤ
27 fzval2 ⊢ 2 ∈ ℤ ∧ A ∈ ℤ → 2 … A = 2 A ∩ ℤ
28 26 7 27 sylancr ⊢ A ∈ ℝ → 2 … A = 2 A ∩ ℤ
29 inss1 ⊢ 2 A ∩ ℤ ⊆ 2 A
30 10 a1i ⊢ A ∈ ℝ → 0 ∈ ℝ
31 id ⊢ A ∈ ℝ → A ∈ ℝ
32 0le2 ⊢ 0 ≤ 2
33 32 a1i ⊢ A ∈ ℝ → 0 ≤ 2
34 flle ⊢ A ∈ ℝ → A ≤ A
35 iccss ⊢ 0 ∈ ℝ ∧ A ∈ ℝ ∧ 0 ≤ 2 ∧ A ≤ A → 2 A ⊆ 0 A
36 30 31 33 34 35 syl22anc ⊢ A ∈ ℝ → 2 A ⊆ 0 A
37 29 36 sstrid ⊢ A ∈ ℝ → 2 A ∩ ℤ ⊆ 0 A
38 28 37 eqsstrd ⊢ A ∈ ℝ → 2 … A ⊆ 0 A
39 38 ssrind ⊢ A ∈ ℝ → 2 … A ∩ ℙ ⊆ 0 A ∩ ℙ
40 25 39 eqssd ⊢ A ∈ ℝ → 0 A ∩ ℙ = 2 … A ∩ ℙ