isprm6 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > isprm6		Structured version Visualization version GIF version

Theorem isprm6 16655

Description: A number is prime iff it satisfies Euclid's lemma euclemma 16654. (Contributed by Mario Carneiro, 6-Sep-2015.)

**Assertion**
Ref	Expression
isprm6	⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))))

Distinct variable group: 𝑥,𝑦,𝑃

Proof of Theorem isprm6 Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		prmuz2 16637	. . 3 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
2		euclemma 16654	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑃 ∥ (𝑥 · 𝑦) ↔ (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))
3	2	3expb 1118	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑃 ∥ (𝑥 · 𝑦) ↔ (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))
4	3	biimpd 228	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))
5	4	ralrimivva 3198	. . 3 ⊢ (𝑃 ∈ ℙ → ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)))
6	1, 5	jca 510	. 2 ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))))
7		simpl 481	. . 3 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → 𝑃 ∈ (ℤ_≥‘2))
8		eluz2nn 12872	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (ℤ_≥‘2) → 𝑃 ∈ ℕ)
9	8	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∈ ℕ)
10	9	nnzd 12589	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∈ ℤ)
11		iddvds 16217	. . . . . . . . . . 11 ⊢ (𝑃 ∈ ℤ → 𝑃 ∥ 𝑃)
12	10, 11	syl 17	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∥ 𝑃)
13		nncn 12224	. . . . . . . . . . . 12 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℂ)
14	9, 13	syl 17	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∈ ℂ)
15		nncn 12224	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℂ)
16	15	ad2antrl 724	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑧 ∈ ℂ)
17		nnne0 12250	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ ℕ → 𝑧 ≠ 0)
18	17	ad2antrl 724	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑧 ≠ 0)
19	14, 16, 18	divcan1d 11995	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → ((𝑃 / 𝑧) · 𝑧) = 𝑃)
20	12, 19	breqtrrd 5175	. . . . . . . . 9 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∥ ((𝑃 / 𝑧) · 𝑧))
21	20	adantr 479	. . . . . . . 8 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → 𝑃 ∥ ((𝑃 / 𝑧) · 𝑧))
22		simprr 769	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑧 ∥ 𝑃)
23		simprl 767	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑧 ∈ ℕ)
24		nndivdvds 16210	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℕ ∧ 𝑧 ∈ ℕ) → (𝑧 ∥ 𝑃 ↔ (𝑃 / 𝑧) ∈ ℕ))
25	9, 23, 24	syl2anc 582	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑧 ∥ 𝑃 ↔ (𝑃 / 𝑧) ∈ ℕ))
26	22, 25	mpbid 231	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 / 𝑧) ∈ ℕ)
27	26	nnzd 12589	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 / 𝑧) ∈ ℤ)
28		nnz 12583	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℤ)
29	28	ad2antrl 724	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑧 ∈ ℤ)
30	27, 29	jca 510	. . . . . . . . 9 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → ((𝑃 / 𝑧) ∈ ℤ ∧ 𝑧 ∈ ℤ))
31		oveq1 7418	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑃 / 𝑧) → (𝑥 · 𝑦) = ((𝑃 / 𝑧) · 𝑦))
32	31	breq2d 5159	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑃 / 𝑧) → (𝑃 ∥ (𝑥 · 𝑦) ↔ 𝑃 ∥ ((𝑃 / 𝑧) · 𝑦)))
33		breq2 5151	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑃 / 𝑧) → (𝑃 ∥ 𝑥 ↔ 𝑃 ∥ (𝑃 / 𝑧)))
34	33	orbi1d 913	. . . . . . . . . . 11 ⊢ (𝑥 = (𝑃 / 𝑧) → ((𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦) ↔ (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑦)))
35	32, 34	imbi12d 343	. . . . . . . . . 10 ⊢ (𝑥 = (𝑃 / 𝑧) → ((𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦)) ↔ (𝑃 ∥ ((𝑃 / 𝑧) · 𝑦) → (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑦))))
36		oveq2 7419	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑧 → ((𝑃 / 𝑧) · 𝑦) = ((𝑃 / 𝑧) · 𝑧))
37	36	breq2d 5159	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑃 ∥ ((𝑃 / 𝑧) · 𝑦) ↔ 𝑃 ∥ ((𝑃 / 𝑧) · 𝑧)))
38		breq2 5151	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑧 → (𝑃 ∥ 𝑦 ↔ 𝑃 ∥ 𝑧))
39	38	orbi2d 912	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → ((𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑦) ↔ (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧)))
40	37, 39	imbi12d 343	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑃 ∥ ((𝑃 / 𝑧) · 𝑦) → (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑦)) ↔ (𝑃 ∥ ((𝑃 / 𝑧) · 𝑧) → (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧))))
41	35, 40	rspc2va 3622	. . . . . . . . 9 ⊢ ((((𝑃 / 𝑧) ∈ ℤ ∧ 𝑧 ∈ ℤ) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → (𝑃 ∥ ((𝑃 / 𝑧) · 𝑧) → (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧)))
42	30, 41	sylan 578	. . . . . . . 8 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → (𝑃 ∥ ((𝑃 / 𝑧) · 𝑧) → (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧)))
43	21, 42	mpd 15	. . . . . . 7 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧))
44		dvdsle 16257	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℤ ∧ (𝑃 / 𝑧) ∈ ℕ) → (𝑃 ∥ (𝑃 / 𝑧) → 𝑃 ≤ (𝑃 / 𝑧)))
45	10, 26, 44	syl2anc 582	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 ∥ (𝑃 / 𝑧) → 𝑃 ≤ (𝑃 / 𝑧)))
46	14	div1d 11986	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 / 1) = 𝑃)
47	46	breq1d 5157	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → ((𝑃 / 1) ≤ (𝑃 / 𝑧) ↔ 𝑃 ≤ (𝑃 / 𝑧)))
48	45, 47	sylibrd 258	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 ∥ (𝑃 / 𝑧) → (𝑃 / 1) ≤ (𝑃 / 𝑧)))
49		nnrp 12989	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℝ⁺)
50	49	rpregt0d 13026	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ℕ → (𝑧 ∈ ℝ ∧ 0 < 𝑧))
51	50	ad2antrl 724	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑧 ∈ ℝ ∧ 0 < 𝑧))
52		1rp 12982	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ⁺
53		rpregt0 12992	. . . . . . . . . . . . 13 ⊢ (1 ∈ ℝ⁺ → (1 ∈ ℝ ∧ 0 < 1))
54	52, 53	mp1i 13	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (1 ∈ ℝ ∧ 0 < 1))
55		nnrp 12989	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℝ⁺)
56	9, 55	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∈ ℝ⁺)
57	56	rpregt0d 13026	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 ∈ ℝ ∧ 0 < 𝑃))
58		lediv2 12108	. . . . . . . . . . . 12 ⊢ (((𝑧 ∈ ℝ ∧ 0 < 𝑧) ∧ (1 ∈ ℝ ∧ 0 < 1) ∧ (𝑃 ∈ ℝ ∧ 0 < 𝑃)) → (𝑧 ≤ 1 ↔ (𝑃 / 1) ≤ (𝑃 / 𝑧)))
59	51, 54, 57, 58	syl3anc 1369	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑧 ≤ 1 ↔ (𝑃 / 1) ≤ (𝑃 / 𝑧)))
60	48, 59	sylibrd 258	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 ∥ (𝑃 / 𝑧) → 𝑧 ≤ 1))
61		nnle1eq1 12246	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℕ → (𝑧 ≤ 1 ↔ 𝑧 = 1))
62	61	ad2antrl 724	. . . . . . . . . 10 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑧 ≤ 1 ↔ 𝑧 = 1))
63	60, 62	sylibd 238	. . . . . . . . 9 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 ∥ (𝑃 / 𝑧) → 𝑧 = 1))
64		nnnn0 12483	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℕ₀)
65	64	ad2antrl 724	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑧 ∈ ℕ₀)
66	65	adantr 479	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ 𝑃 ∥ 𝑧) → 𝑧 ∈ ℕ₀)
67		nnnn0 12483	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℕ → 𝑃 ∈ ℕ₀)
68	9, 67	syl 17	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → 𝑃 ∈ ℕ₀)
69	68	adantr 479	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ 𝑃 ∥ 𝑧) → 𝑃 ∈ ℕ₀)
70		simplrr 774	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ 𝑃 ∥ 𝑧) → 𝑧 ∥ 𝑃)
71		simpr 483	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ 𝑃 ∥ 𝑧) → 𝑃 ∥ 𝑧)
72		dvdseq 16261	. . . . . . . . . . 11 ⊢ (((𝑧 ∈ ℕ₀ ∧ 𝑃 ∈ ℕ₀) ∧ (𝑧 ∥ 𝑃 ∧ 𝑃 ∥ 𝑧)) → 𝑧 = 𝑃)
73	66, 69, 70, 71, 72	syl22anc 835	. . . . . . . . . 10 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ 𝑃 ∥ 𝑧) → 𝑧 = 𝑃)
74	73	ex 411	. . . . . . . . 9 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑃 ∥ 𝑧 → 𝑧 = 𝑃))
75	63, 74	orim12d 961	. . . . . . . 8 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → ((𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧) → (𝑧 = 1 ∨ 𝑧 = 𝑃)))
76	75	imp 405	. . . . . . 7 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ (𝑃 ∥ (𝑃 / 𝑧) ∨ 𝑃 ∥ 𝑧)) → (𝑧 = 1 ∨ 𝑧 = 𝑃))
77	43, 76	syldan 589	. . . . . 6 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → (𝑧 = 1 ∨ 𝑧 = 𝑃))
78	77	an32s 648	. . . . 5 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) ∧ (𝑧 ∈ ℕ ∧ 𝑧 ∥ 𝑃)) → (𝑧 = 1 ∨ 𝑧 = 𝑃))
79	78	expr 455	. . . 4 ⊢ (((𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) ∧ 𝑧 ∈ ℕ) → (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))
80	79	ralrimiva 3144	. . 3 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃)))
81		isprm2 16623	. . 3 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑧 ∈ ℕ (𝑧 ∥ 𝑃 → (𝑧 = 1 ∨ 𝑧 = 𝑃))))
82	7, 80, 81	sylanbrc 581	. 2 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))) → 𝑃 ∈ ℙ)
83	6, 82	impbii 208	1 ⊢ (𝑃 ∈ ℙ ↔ (𝑃 ∈ (ℤ_≥‘2) ∧ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℤ (𝑃 ∥ (𝑥 · 𝑦) → (𝑃 ∥ 𝑥 ∨ 𝑃 ∥ 𝑦))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 843 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∀wral 3059 class class class wbr 5147 ‘cfv 6542 (class class class)co 7411 ℂcc 11110 ℝcr 11111 0cc0 11112 1c1 11113 · cmul 11117 < clt 11252 ≤ cle 11253 / cdiv 11875 ℕcn 12216 2c2 12271 ℕ₀cn0 12476 ℤcz 12562 ℤ_≥cuz 12826 ℝ⁺crp 12978 ∥ cdvds 16201 ℙcprime 16612

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-3 12280 df-n0 12477 df-z 12563 df-uz 12827 df-rp 12979 df-fl 13761 df-mod 13839 df-seq 13971 df-exp 14032 df-cj 15050 df-re 15051 df-im 15052 df-sqrt 15186 df-abs 15187 df-dvds 16202 df-gcd 16440 df-prm 16613

This theorem is referenced by: domnchr 21303

W3C validator