Proof of Theorem ply1degleel
Step | Hyp | Ref
| Expression |
1 | | simpr 484 |
. . . 4
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → 𝐹 = (0g‘𝑃)) |
2 | | ply1degltlss.d |
. . . . . . . . . 10
⊢ 𝐷 = ( deg1
‘𝑅) |
3 | | ply1degltlss.p |
. . . . . . . . . 10
⊢ 𝑃 = (Poly1‘𝑅) |
4 | | ply1degltel.1 |
. . . . . . . . . 10
⊢ 𝐵 = (Base‘𝑃) |
5 | 2, 3, 4 | deg1xrf 25848 |
. . . . . . . . 9
⊢ 𝐷:𝐵⟶ℝ* |
6 | 5 | a1i 11 |
. . . . . . . 8
⊢ (𝜑 → 𝐷:𝐵⟶ℝ*) |
7 | 6 | ffnd 6718 |
. . . . . . 7
⊢ (𝜑 → 𝐷 Fn 𝐵) |
8 | | ply1degltlss.2 |
. . . . . . . 8
⊢ (𝜑 → 𝑅 ∈ Ring) |
9 | 3 | ply1ring 22003 |
. . . . . . . 8
⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) |
10 | | eqid 2731 |
. . . . . . . . 9
⊢
(0g‘𝑃) = (0g‘𝑃) |
11 | 4, 10 | ring0cl 20159 |
. . . . . . . 8
⊢ (𝑃 ∈ Ring →
(0g‘𝑃)
∈ 𝐵) |
12 | 8, 9, 11 | 3syl 18 |
. . . . . . 7
⊢ (𝜑 → (0g‘𝑃) ∈ 𝐵) |
13 | 2, 3, 10 | deg1z 25854 |
. . . . . . . . 9
⊢ (𝑅 ∈ Ring → (𝐷‘(0g‘𝑃)) = -∞) |
14 | 8, 13 | syl 17 |
. . . . . . . 8
⊢ (𝜑 → (𝐷‘(0g‘𝑃)) = -∞) |
15 | | mnfxr 11278 |
. . . . . . . . . 10
⊢ -∞
∈ ℝ* |
16 | 15 | a1i 11 |
. . . . . . . . 9
⊢ (𝜑 → -∞ ∈
ℝ*) |
17 | | ply1degltlss.3 |
. . . . . . . . . . 11
⊢ (𝜑 → 𝑁 ∈
ℕ0) |
18 | 17 | nn0red 12540 |
. . . . . . . . . 10
⊢ (𝜑 → 𝑁 ∈ ℝ) |
19 | 18 | rexrd 11271 |
. . . . . . . . 9
⊢ (𝜑 → 𝑁 ∈
ℝ*) |
20 | 16 | xrleidd 13138 |
. . . . . . . . 9
⊢ (𝜑 → -∞ ≤
-∞) |
21 | 18 | mnfltd 13111 |
. . . . . . . . 9
⊢ (𝜑 → -∞ < 𝑁) |
22 | 16, 19, 16, 20, 21 | elicod 13381 |
. . . . . . . 8
⊢ (𝜑 → -∞ ∈
(-∞[,)𝑁)) |
23 | 14, 22 | eqeltrd 2832 |
. . . . . . 7
⊢ (𝜑 → (𝐷‘(0g‘𝑃)) ∈ (-∞[,)𝑁)) |
24 | 7, 12, 23 | elpreimad 7060 |
. . . . . 6
⊢ (𝜑 → (0g‘𝑃) ∈ (◡𝐷 “ (-∞[,)𝑁))) |
25 | | ply1degltlss.1 |
. . . . . 6
⊢ 𝑆 = (◡𝐷 “ (-∞[,)𝑁)) |
26 | 24, 25 | eleqtrrdi 2843 |
. . . . 5
⊢ (𝜑 → (0g‘𝑃) ∈ 𝑆) |
27 | 26 | adantr 480 |
. . . 4
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → (0g‘𝑃) ∈ 𝑆) |
28 | 1, 27 | eqeltrd 2832 |
. . 3
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → 𝐹 ∈ 𝑆) |
29 | | cnvimass 6080 |
. . . . . 6
⊢ (◡𝐷 “ (-∞[,)𝑁)) ⊆ dom 𝐷 |
30 | 25, 29 | eqsstri 4016 |
. . . . 5
⊢ 𝑆 ⊆ dom 𝐷 |
31 | 5 | fdmi 6729 |
. . . . 5
⊢ dom 𝐷 = 𝐵 |
32 | 30, 31 | sseqtri 4018 |
. . . 4
⊢ 𝑆 ⊆ 𝐵 |
33 | 32, 28 | sselid 3980 |
. . 3
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → 𝐹 ∈ 𝐵) |
34 | 1 | fveq2d 6895 |
. . . . 5
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → (𝐷‘𝐹) = (𝐷‘(0g‘𝑃))) |
35 | 14 | adantr 480 |
. . . . 5
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → (𝐷‘(0g‘𝑃)) = -∞) |
36 | 34, 35 | eqtrd 2771 |
. . . 4
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → (𝐷‘𝐹) = -∞) |
37 | 18 | adantr 480 |
. . . . 5
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → 𝑁 ∈ ℝ) |
38 | 37 | mnfltd 13111 |
. . . 4
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → -∞ < 𝑁) |
39 | 36, 38 | eqbrtrd 5170 |
. . 3
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → (𝐷‘𝐹) < 𝑁) |
40 | | pm5.1 821 |
. . 3
⊢ ((𝐹 ∈ 𝑆 ∧ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) < 𝑁)) → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) < 𝑁))) |
41 | 28, 33, 39, 40 | syl12anc 834 |
. 2
⊢ ((𝜑 ∧ 𝐹 = (0g‘𝑃)) → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) < 𝑁))) |
42 | 25 | eleq2i 2824 |
. . . 4
⊢ (𝐹 ∈ 𝑆 ↔ 𝐹 ∈ (◡𝐷 “ (-∞[,)𝑁))) |
43 | 7 | adantr 480 |
. . . . 5
⊢ ((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) → 𝐷 Fn 𝐵) |
44 | | elpreima 7059 |
. . . . 5
⊢ (𝐷 Fn 𝐵 → (𝐹 ∈ (◡𝐷 “ (-∞[,)𝑁)) ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ (-∞[,)𝑁)))) |
45 | 43, 44 | syl 17 |
. . . 4
⊢ ((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) → (𝐹 ∈ (◡𝐷 “ (-∞[,)𝑁)) ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ (-∞[,)𝑁)))) |
46 | 42, 45 | bitrid 283 |
. . 3
⊢ ((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ (-∞[,)𝑁)))) |
47 | 8 | ad2antrr 723 |
. . . . . . . . 9
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → 𝑅 ∈ Ring) |
48 | | simpr 484 |
. . . . . . . . 9
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → 𝐹 ∈ 𝐵) |
49 | | simplr 766 |
. . . . . . . . 9
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → 𝐹 ≠ (0g‘𝑃)) |
50 | 2, 3, 10, 4 | deg1nn0cl 25855 |
. . . . . . . . 9
⊢ ((𝑅 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐹 ≠ (0g‘𝑃)) → (𝐷‘𝐹) ∈
ℕ0) |
51 | 47, 48, 49, 50 | syl3anc 1370 |
. . . . . . . 8
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → (𝐷‘𝐹) ∈
ℕ0) |
52 | 51 | nn0red 12540 |
. . . . . . 7
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → (𝐷‘𝐹) ∈ ℝ) |
53 | 52 | rexrd 11271 |
. . . . . 6
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → (𝐷‘𝐹) ∈
ℝ*) |
54 | 53 | mnfled 13122 |
. . . . . 6
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → -∞ ≤ (𝐷‘𝐹)) |
55 | 53, 54 | jca 511 |
. . . . 5
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → ((𝐷‘𝐹) ∈ ℝ* ∧ -∞
≤ (𝐷‘𝐹))) |
56 | 19 | ad2antrr 723 |
. . . . . . 7
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → 𝑁 ∈
ℝ*) |
57 | | elico1 13374 |
. . . . . . 7
⊢
((-∞ ∈ ℝ* ∧ 𝑁 ∈ ℝ*) → ((𝐷‘𝐹) ∈ (-∞[,)𝑁) ↔ ((𝐷‘𝐹) ∈ ℝ* ∧ -∞
≤ (𝐷‘𝐹) ∧ (𝐷‘𝐹) < 𝑁))) |
58 | 15, 56, 57 | sylancr 586 |
. . . . . 6
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → ((𝐷‘𝐹) ∈ (-∞[,)𝑁) ↔ ((𝐷‘𝐹) ∈ ℝ* ∧ -∞
≤ (𝐷‘𝐹) ∧ (𝐷‘𝐹) < 𝑁))) |
59 | | df-3an 1088 |
. . . . . 6
⊢ (((𝐷‘𝐹) ∈ ℝ* ∧ -∞
≤ (𝐷‘𝐹) ∧ (𝐷‘𝐹) < 𝑁) ↔ (((𝐷‘𝐹) ∈ ℝ* ∧ -∞
≤ (𝐷‘𝐹)) ∧ (𝐷‘𝐹) < 𝑁)) |
60 | 58, 59 | bitrdi 287 |
. . . . 5
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → ((𝐷‘𝐹) ∈ (-∞[,)𝑁) ↔ (((𝐷‘𝐹) ∈ ℝ* ∧ -∞
≤ (𝐷‘𝐹)) ∧ (𝐷‘𝐹) < 𝑁))) |
61 | 55, 60 | mpbirand 704 |
. . . 4
⊢ (((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) ∧ 𝐹 ∈ 𝐵) → ((𝐷‘𝐹) ∈ (-∞[,)𝑁) ↔ (𝐷‘𝐹) < 𝑁)) |
62 | 61 | pm5.32da 578 |
. . 3
⊢ ((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) → ((𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) ∈ (-∞[,)𝑁)) ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) < 𝑁))) |
63 | 46, 62 | bitrd 279 |
. 2
⊢ ((𝜑 ∧ 𝐹 ≠ (0g‘𝑃)) → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) < 𝑁))) |
64 | 41, 63 | pm2.61dane 3028 |
1
⊢ (𝜑 → (𝐹 ∈ 𝑆 ↔ (𝐹 ∈ 𝐵 ∧ (𝐷‘𝐹) < 𝑁))) |