Metamath Proof Explorer


Theorem nprm

Description: A product of two integers greater than one is composite. (Contributed by Mario Carneiro, 20-Jun-2015)

Ref Expression
Assertion nprm ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → ¬ A ⁢ B ∈ ℙ

Proof

Step Hyp Ref Expression
1 eluzelz ⊢ A ∈ ℤ ≥ 2 → A ∈ ℤ
2 1 adantr ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ∈ ℤ
3 2 zred ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ∈ ℝ
4 eluz2gt1 ⊢ B ∈ ℤ ≥ 2 → 1 < B
5 4 adantl ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → 1 < B
6 eluzelz ⊢ B ∈ ℤ ≥ 2 → B ∈ ℤ
7 6 adantl ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → B ∈ ℤ
8 7 zred ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → B ∈ ℝ
9 eluz2nn ⊢ A ∈ ℤ ≥ 2 → A ∈ ℕ
10 9 adantr ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ∈ ℕ
11 10 nngt0d ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → 0 < A
12 ltmulgt11 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ 0 < A → 1 < B ↔ A < A ⁢ B
13 3 8 11 12 syl3anc ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → 1 < B ↔ A < A ⁢ B
14 5 13 mpbid ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A < A ⁢ B
15 3 14 ltned ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ≠ A ⁢ B
16 dvdsmul1 ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ∥ A ⁢ B
17 1 6 16 syl2an ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ∥ A ⁢ B
18 isprm4 ⊢ A ⁢ B ∈ ℙ ↔ A ⁢ B ∈ ℤ ≥ 2 ∧ ∀ x ∈ ℤ ≥ 2 x ∥ A ⁢ B → x = A ⁢ B
19 18 simprbi ⊢ A ⁢ B ∈ ℙ → ∀ x ∈ ℤ ≥ 2 x ∥ A ⁢ B → x = A ⁢ B
20 breq1 ⊢ x = A → x ∥ A ⁢ B ↔ A ∥ A ⁢ B
21 eqeq1 ⊢ x = A → x = A ⁢ B ↔ A = A ⁢ B
22 20 21 imbi12d ⊢ x = A → x ∥ A ⁢ B → x = A ⁢ B ↔ A ∥ A ⁢ B → A = A ⁢ B
23 22 rspcv ⊢ A ∈ ℤ ≥ 2 → ∀ x ∈ ℤ ≥ 2 x ∥ A ⁢ B → x = A ⁢ B → A ∥ A ⁢ B → A = A ⁢ B
24 19 23 syl5 ⊢ A ∈ ℤ ≥ 2 → A ⁢ B ∈ ℙ → A ∥ A ⁢ B → A = A ⁢ B
25 24 adantr ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ⁢ B ∈ ℙ → A ∥ A ⁢ B → A = A ⁢ B
26 17 25 mpid ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ⁢ B ∈ ℙ → A = A ⁢ B
27 26 necon3ad ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → A ≠ A ⁢ B → ¬ A ⁢ B ∈ ℙ
28 15 27 mpd ⊢ A ∈ ℤ ≥ 2 ∧ B ∈ ℤ ≥ 2 → ¬ A ⁢ B ∈ ℙ