prmreclem1 - Metamath Proof Explorer

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

Theorem prmreclem1 17138

Description: Lemma for prmrec 17144. Properties of the "square part" function, which extracts the 𝑚 of the decomposition 𝑁 = 𝑟𝑚↑2, with 𝑚 maximal and 𝑟 squarefree. (Contributed by Mario Carneiro, 5-Aug-2014.)

**Hypothesis**
Ref	Expression
prmreclem1.1	⊢ 𝑄 = (𝑛 ∈ ℕ ↦ sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑛}, ℝ, < ))

**Assertion**
Ref	Expression
prmreclem1	⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁) ∈ ℕ ∧ ((𝑄‘𝑁)↑2) ∥ 𝑁 ∧ (𝐾 ∈ (ℤ_≥‘2) → ¬ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2)))))

Distinct variable groups: 𝐾,𝑟 𝑛,𝑟,𝑁 𝑄,𝑟 Allowed substitution hints: 𝑄(𝑛) 𝐾(𝑛)

Proof of Theorem prmreclem1 Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 4008	. . 3 ⊢ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ⊆ ℕ
2		breq2 5112	. . . . . . 7 ⊢ (𝑛 = 𝑁 → ((𝑟↑2) ∥ 𝑛 ↔ (𝑟↑2) ∥ 𝑁))
3	2	rabbidv 3423	. . . . . 6 ⊢ (𝑛 = 𝑁 → {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑛} = {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁})
4	3	supeq1d 9475	. . . . 5 ⊢ (𝑛 = 𝑁 → sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑛}, ℝ, < ) = sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ))
5		prmreclem1.1	. . . . 5 ⊢ 𝑄 = (𝑛 ∈ ℕ ↦ sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑛}, ℝ, < ))
6		ltso 11429	. . . . . 6 ⊢ < Or ℝ
7	6	supex 9493	. . . . 5 ⊢ sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ) ∈ V
8	4, 5, 7	fvmpt 7024	. . . 4 ⊢ (𝑁 ∈ ℕ → (𝑄‘𝑁) = sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ))
9		nnssz 12755	. . . . . 6 ⊢ ℕ ⊆ ℤ
10	1, 9	sstri 3922	. . . . 5 ⊢ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ⊆ ℤ
11		oveq1 7458	. . . . . . . . 9 ⊢ (𝑟 = 1 → (𝑟↑2) = (1↑2))
12		sq1 14378	. . . . . . . . 9 ⊢ (1↑2) = 1
13	11, 12	eqtrdi 2814	. . . . . . . 8 ⊢ (𝑟 = 1 → (𝑟↑2) = 1)
14	13	breq1d 5118	. . . . . . 7 ⊢ (𝑟 = 1 → ((𝑟↑2) ∥ 𝑁 ↔ 1 ∥ 𝑁))
15		1nn 12386	. . . . . . . 8 ⊢ 1 ∈ ℕ
16	15	a1i 11	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → 1 ∈ ℕ)
17		nnz 12754	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ)
18		1dvds 16484	. . . . . . . 8 ⊢ (𝑁 ∈ ℤ → 1 ∥ 𝑁)
19	17, 18	syl 18	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → 1 ∥ 𝑁)
20	14, 16, 19	elrabd 3650	. . . . . 6 ⊢ (𝑁 ∈ ℕ → 1 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁})
21	20	ne0d 4291	. . . . 5 ⊢ (𝑁 ∈ ℕ → {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ≠ ∅)
22		nnz 12754	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℤ)
23		zsqcl 14312	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℤ → (𝑧↑2) ∈ ℤ)
24	22, 23	syl 18	. . . . . . . . . 10 ⊢ (𝑧 ∈ ℕ → (𝑧↑2) ∈ ℤ)
25		id 23	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ)
26		dvdsle 16524	. . . . . . . . . 10 ⊢ (((𝑧↑2) ∈ ℤ ∧ 𝑁 ∈ ℕ) → ((𝑧↑2) ∥ 𝑁 → (𝑧↑2) ≤ 𝑁))
27	24, 25, 26	syl2anr 609	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → ((𝑧↑2) ∥ 𝑁 → (𝑧↑2) ≤ 𝑁))
28		nnlesq 14389	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℕ → 𝑧 ≤ (𝑧↑2))
29	28	adantl 487	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → 𝑧 ≤ (𝑧↑2))
30		nnre 12382	. . . . . . . . . . . 12 ⊢ (𝑧 ∈ ℕ → 𝑧 ∈ ℝ)
31	30	adantl 487	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → 𝑧 ∈ ℝ)
32	31	resqcld 14308	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → (𝑧↑2) ∈ ℝ)
33		nnre 12382	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℝ)
34	33	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → 𝑁 ∈ ℝ)
35		letr 11443	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ ℝ ∧ (𝑧↑2) ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑧 ≤ (𝑧↑2) ∧ (𝑧↑2) ≤ 𝑁) → 𝑧 ≤ 𝑁))
36	31, 32, 34, 35	syl3anc 1399	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → ((𝑧 ≤ (𝑧↑2) ∧ (𝑧↑2) ≤ 𝑁) → 𝑧 ≤ 𝑁))
37	29, 36	mpand 708	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → ((𝑧↑2) ≤ 𝑁 → 𝑧 ≤ 𝑁))
38	27, 37	syld 48	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝑧 ∈ ℕ) → ((𝑧↑2) ∥ 𝑁 → 𝑧 ≤ 𝑁))
39	38	ralrimiva 3158	. . . . . . 7 ⊢ (𝑁 ∈ ℕ → ∀𝑧 ∈ ℕ ((𝑧↑2) ∥ 𝑁 → 𝑧 ≤ 𝑁))
40		oveq1 7458	. . . . . . . . 9 ⊢ (𝑟 = 𝑧 → (𝑟↑2) = (𝑧↑2))
41	40	breq1d 5118	. . . . . . . 8 ⊢ (𝑟 = 𝑧 → ((𝑟↑2) ∥ 𝑁 ↔ (𝑧↑2) ∥ 𝑁))
42	41	ralrab 3655	. . . . . . 7 ⊢ (∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑁 ↔ ∀𝑧 ∈ ℕ ((𝑧↑2) ∥ 𝑁 → 𝑧 ≤ 𝑁))
43	39, 42	sylibr 237	. . . . . 6 ⊢ (𝑁 ∈ ℕ → ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑁)
44		brralrspcev 5171	. . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑁) → ∃𝑥 ∈ ℤ ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑥)
45	17, 43, 44	syl2anc 596	. . . . 5 ⊢ (𝑁 ∈ ℕ → ∃𝑥 ∈ ℤ ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑥)
46		suprzcl2 13105	. . . . 5 ⊢ (({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ⊆ ℤ ∧ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑥) → sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ) ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁})
47	10, 21, 45, 46	mp3an2i 1496	. . . 4 ⊢ (𝑁 ∈ ℕ → sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ) ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁})
48	8, 47	eqeltrd 2864	. . 3 ⊢ (𝑁 ∈ ℕ → (𝑄‘𝑁) ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁})
49	1, 48	sselid 3911	. 2 ⊢ (𝑁 ∈ ℕ → (𝑄‘𝑁) ∈ ℕ)
50		oveq1 7458	. . . . . 6 ⊢ (𝑧 = (𝑄‘𝑁) → (𝑧↑2) = ((𝑄‘𝑁)↑2))
51	50	breq1d 5118	. . . . 5 ⊢ (𝑧 = (𝑄‘𝑁) → ((𝑧↑2) ∥ 𝑁 ↔ ((𝑄‘𝑁)↑2) ∥ 𝑁))
52	41	cbvrabv 3426	. . . . 5 ⊢ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} = {𝑧 ∈ ℕ ∣ (𝑧↑2) ∥ 𝑁}
53	51, 52	elrab2 3652	. . . 4 ⊢ ((𝑄‘𝑁) ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ↔ ((𝑄‘𝑁) ∈ ℕ ∧ ((𝑄‘𝑁)↑2) ∥ 𝑁))
54	48, 53	sylib 221	. . 3 ⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁) ∈ ℕ ∧ ((𝑄‘𝑁)↑2) ∥ 𝑁))
55	54	simprd 501	. 2 ⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁)↑2) ∥ 𝑁)
56	49	adantr 486	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → (𝑄‘𝑁) ∈ ℕ)
57	56	nncnd 12391	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → (𝑄‘𝑁) ∈ ℂ)
58	57	mulridd 11365	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ((𝑄‘𝑁) · 1) = (𝑄‘𝑁))
59		eluz2gt1 13087	. . . . . . . 8 ⊢ (𝐾 ∈ (ℤ_≥‘2) → 1 < 𝐾)
60	59	adantl 487	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → 1 < 𝐾)
61		1red 11348	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → 1 ∈ ℝ)
62		eluz2nn 13055	. . . . . . . . . 10 ⊢ (𝐾 ∈ (ℤ_≥‘2) → 𝐾 ∈ ℕ)
63	62	adantl 487	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → 𝐾 ∈ ℕ)
64	63	nnred 12390	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → 𝐾 ∈ ℝ)
65	56	nnred 12390	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → (𝑄‘𝑁) ∈ ℝ)
66	56	nngt0d 12427	. . . . . . . 8 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → 0 < (𝑄‘𝑁))
67		ltmul2 12208	. . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝐾 ∈ ℝ ∧ ((𝑄‘𝑁) ∈ ℝ ∧ 0 < (𝑄‘𝑁))) → (1 < 𝐾 ↔ ((𝑄‘𝑁) · 1) < ((𝑄‘𝑁) · 𝐾)))
68	61, 64, 65, 66, 67	syl112anc 1402	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → (1 < 𝐾 ↔ ((𝑄‘𝑁) · 1) < ((𝑄‘𝑁) · 𝐾)))
69	60, 68	mpbid 235	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ((𝑄‘𝑁) · 1) < ((𝑄‘𝑁) · 𝐾))
70	58, 69	eqbrtrrd 5135	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → (𝑄‘𝑁) < ((𝑄‘𝑁) · 𝐾))
71		nnmulcl 12399	. . . . . . . 8 ⊢ (((𝑄‘𝑁) ∈ ℕ ∧ 𝐾 ∈ ℕ) → ((𝑄‘𝑁) · 𝐾) ∈ ℕ)
72	49, 62, 71	syl2an 608	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ((𝑄‘𝑁) · 𝐾) ∈ ℕ)
73	72	nnred 12390	. . . . . 6 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ((𝑄‘𝑁) · 𝐾) ∈ ℝ)
74	65, 73	ltnled 11496	. . . . 5 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ((𝑄‘𝑁) < ((𝑄‘𝑁) · 𝐾) ↔ ¬ ((𝑄‘𝑁) · 𝐾) ≤ (𝑄‘𝑁)))
75	70, 74	mpbid 235	. . . 4 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ¬ ((𝑄‘𝑁) · 𝐾) ≤ (𝑄‘𝑁))
76	45	ad2antrr 739	. . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ∃𝑥 ∈ ℤ ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑥)
77		oveq1 7458	. . . . . . . 8 ⊢ (𝑟 = ((𝑄‘𝑁) · 𝐾) → (𝑟↑2) = (((𝑄‘𝑁) · 𝐾)↑2))
78	77	breq1d 5118	. . . . . . 7 ⊢ (𝑟 = ((𝑄‘𝑁) · 𝐾) → ((𝑟↑2) ∥ 𝑁 ↔ (((𝑄‘𝑁) · 𝐾)↑2) ∥ 𝑁))
79	72	adantr 486	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁) · 𝐾) ∈ ℕ)
80		simpr 490	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2)))
81	63	adantr 486	. . . . . . . . . . . 12 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → 𝐾 ∈ ℕ)
82	81	nnsqcld 14429	. . . . . . . . . . 11 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (𝐾↑2) ∈ ℕ)
83		nnz 12754	. . . . . . . . . . 11 ⊢ ((𝐾↑2) ∈ ℕ → (𝐾↑2) ∈ ℤ)
84	82, 83	syl 18	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (𝐾↑2) ∈ ℤ)
85	49	nnsqcld 14429	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁)↑2) ∈ ℕ)
86	9, 85	sselid 3911	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁)↑2) ∈ ℤ)
87	85	nnne0d 12428	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁)↑2) ≠ 0)
88		dvdsval2 16469	. . . . . . . . . . . . 13 ⊢ ((((𝑄‘𝑁)↑2) ∈ ℤ ∧ ((𝑄‘𝑁)↑2) ≠ 0 ∧ 𝑁 ∈ ℤ) → (((𝑄‘𝑁)↑2) ∥ 𝑁 ↔ (𝑁 / ((𝑄‘𝑁)↑2)) ∈ ℤ))
89	86, 87, 17, 88	syl3anc 1399	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ ℕ → (((𝑄‘𝑁)↑2) ∥ 𝑁 ↔ (𝑁 / ((𝑄‘𝑁)↑2)) ∈ ℤ))
90	55, 89	mpbid 235	. . . . . . . . . . 11 ⊢ (𝑁 ∈ ℕ → (𝑁 / ((𝑄‘𝑁)↑2)) ∈ ℤ)
91	90	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (𝑁 / ((𝑄‘𝑁)↑2)) ∈ ℤ)
92	86	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁)↑2) ∈ ℤ)
93		dvdscmul 16496	. . . . . . . . . 10 ⊢ (((𝐾↑2) ∈ ℤ ∧ (𝑁 / ((𝑄‘𝑁)↑2)) ∈ ℤ ∧ ((𝑄‘𝑁)↑2) ∈ ℤ) → ((𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2)) → (((𝑄‘𝑁)↑2) · (𝐾↑2)) ∥ (((𝑄‘𝑁)↑2) · (𝑁 / ((𝑄‘𝑁)↑2)))))
94	84, 91, 92, 93	syl3anc 1399	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2)) → (((𝑄‘𝑁)↑2) · (𝐾↑2)) ∥ (((𝑄‘𝑁)↑2) · (𝑁 / ((𝑄‘𝑁)↑2)))))
95	80, 94	mpd 16	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (((𝑄‘𝑁)↑2) · (𝐾↑2)) ∥ (((𝑄‘𝑁)↑2) · (𝑁 / ((𝑄‘𝑁)↑2))))
96	57	adantr 486	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (𝑄‘𝑁) ∈ ℂ)
97	81	nncnd 12391	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → 𝐾 ∈ ℂ)
98	96, 97	sqmuld 14341	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (((𝑄‘𝑁) · 𝐾)↑2) = (((𝑄‘𝑁)↑2) · (𝐾↑2)))
99	98	eqcomd 2769	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (((𝑄‘𝑁)↑2) · (𝐾↑2)) = (((𝑄‘𝑁) · 𝐾)↑2))
100		nncn 12383	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℂ)
101	100	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → 𝑁 ∈ ℂ)
102	85	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁)↑2) ∈ ℕ)
103	102	nncnd 12391	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁)↑2) ∈ ℂ)
104	87	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁)↑2) ≠ 0)
105	101, 103, 104	divcan2d 12135	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (((𝑄‘𝑁)↑2) · (𝑁 / ((𝑄‘𝑁)↑2))) = 𝑁)
106	95, 99, 105	3brtr3d 5142	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (((𝑄‘𝑁) · 𝐾)↑2) ∥ 𝑁)
107	78, 79, 106	elrabd 3650	. . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁) · 𝐾) ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁})
108		suprzub 13106	. . . . . 6 ⊢ (({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁} ⊆ ℤ ∧ ∃𝑥 ∈ ℤ ∀𝑧 ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}𝑧 ≤ 𝑥 ∧ ((𝑄‘𝑁) · 𝐾) ∈ {𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}) → ((𝑄‘𝑁) · 𝐾) ≤ sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ))
109	10, 76, 107, 108	mp3an2i 1496	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁) · 𝐾) ≤ sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ))
110	8	ad2antrr 739	. . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → (𝑄‘𝑁) = sup({𝑟 ∈ ℕ ∣ (𝑟↑2) ∥ 𝑁}, ℝ, < ))
111	109, 110	breqtrrd 5139	. . . 4 ⊢ (((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) ∧ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))) → ((𝑄‘𝑁) · 𝐾) ≤ (𝑄‘𝑁))
112	75, 111	mtand 828	. . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝐾 ∈ (ℤ_≥‘2)) → ¬ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2)))
113	112	ex 418	. 2 ⊢ (𝑁 ∈ ℕ → (𝐾 ∈ (ℤ_≥‘2) → ¬ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2))))
114	49, 55, 113	3jca 1146	1 ⊢ (𝑁 ∈ ℕ → ((𝑄‘𝑁) ∈ ℕ ∧ ((𝑄‘𝑁)↑2) ∥ 𝑁 ∧ (𝐾 ∈ (ℤ_≥‘2) → ¬ (𝐾↑2) ∥ (𝑁 / ((𝑄‘𝑁)↑2)))))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∅c0 4281 class class class wbr 5108 ↦ cmpt 5192 ‘cfv 6566 (class class class)co 7451 supcsup 9469 ℂcc 11237 ℝcr 11238 0cc0 11239 1c1 11240 · cmul 11244 < clt 11382 ≤ cle 11383 / cdiv 12013 ℕcn 12375 2c2 12437 ℤcz 12733 ℤ_≥cuz 13005 ↑cexp 14244 ∥ cdvds 16466

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-seq 14185 df-exp 14245 df-dvds 16467

This theorem is used by: prmreclem2 17139 prmreclem3 17140

W3C validator