Proof of Theorem ssgt0sr
| Step | Hyp | Ref
| Expression |
| 1 | | ssgt0sr.1 |
. . . . . . . . . . . 12
⊢ A
∈ V |
| 2 | 1 | sqgt0sr 4009 |
. . . . . . . . . . 11
⊢ (A
∈ R → (¬ A =
0R → 0R
<R (A
·R A))) |
| 3 | 2 | imp 277 |
. . . . . . . . . 10
⊢ ((A
∈ R ∧ ¬ A =
0R) → 0R
<R (A
·R A)) |
| 4 | 3 | adantrr 312 |
. . . . . . . . 9
⊢ ((A
∈ R ∧ (¬ A =
0R ∧ B =
0R)) → 0R
<R (A
·R A)) |
| 5 | | opreq12 3008 |
. . . . . . . . . . . . . . 15
⊢ ((B =
0R ∧ B =
0R) → (B
·R B) =
(0R ·R
0R)) |
| 6 | 5 | anidms 332 |
. . . . . . . . . . . . . 14
⊢ (B =
0R → (B
·R B) =
(0R ·R
0R)) |
| 7 | | 0r 3983 |
. . . . . . . . . . . . . . 15
⊢ 0R ∈
R |
| 8 | | 00sr 4002 |
. . . . . . . . . . . . . . 15
⊢ (0R ∈
R → (0R
·R 0R) =
0R) |
| 9 | 7, 8 | ax-mp 6 |
. . . . . . . . . . . . . 14
⊢ (0R
·R 0R) =
0R |
| 10 | 6, 9 | syl6eq 1140 |
. . . . . . . . . . . . 13
⊢ (B =
0R → (B
·R B) =
0R) |
| 11 | 10 | opreq2d 3013 |
. . . . . . . . . . . 12
⊢ (B =
0R → ((A
·R A)
+R (B
·R B)) =
((A ·R
A) +R
0R)) |
| 12 | | mulclsr 3987 |
. . . . . . . . . . . . . 14
⊢ ((A
∈ R ∧ A ∈
R) → (A
·R A)
∈ R) |
| 13 | 12 | anidms 332 |
. . . . . . . . . . . . 13
⊢ (A
∈ R → (A
·R A)
∈ R) |
| 14 | | 0idsr 4000 |
. . . . . . . . . . . . 13
⊢ ((A
·R A)
∈ R → ((A
·R A)
+R 0R) = (A ·R A)) |
| 15 | 13, 14 | syl 12 |
. . . . . . . . . . . 12
⊢ (A
∈ R → ((A
·R A)
+R 0R) = (A ·R A)) |
| 16 | 11, 15 | sylan9eqr 1145 |
. . . . . . . . . . 11
⊢ ((A
∈ R ∧ B =
0R) → ((A
·R A)
+R (B
·R B)) =
(A ·R
A)) |
| 17 | 16 | breq2d 2072 |
. . . . . . . . . 10
⊢ ((A
∈ R ∧ B =
0R) → (0R
<R ((A
·R A)
+R (B
·R B))
↔ 0R <R (A ·R A))) |
| 18 | 17 | adantrl 311 |
. . . . . . . . 9
⊢ ((A
∈ R ∧ (¬ A =
0R ∧ B =
0R)) → (0R
<R ((A
·R A)
+R (B
·R B))
↔ 0R <R (A ·R A))) |
| 19 | 4, 18 | mpbird 171 |
. . . . . . . 8
⊢ ((A
∈ R ∧ (¬ A =
0R ∧ B =
0R)) → 0R
<R ((A
·R A)
+R (B
·R B))) |
| 20 | 19 | adantlr 310 |
. . . . . . 7
⊢ (((A
∈ R ∧ B ∈
R) ∧ (¬ A =
0R ∧ B =
0R)) → 0R
<R ((A
·R A)
+R (B
·R B))) |
| 21 | 20 | ancoms 334 |
. . . . . 6
⊢ (((¬ A = 0R ∧ B = 0R) ∧ (A ∈ R ∧ B ∈ R)) →
0R <R ((A ·R A) +R (B ·R B))) |
| 22 | 21 | exp31 293 |
. . . . 5
⊢ (¬ A = 0R → (B = 0R → ((A ∈ R ∧ B ∈ R) →
0R <R ((A ·R A) +R (B ·R B))))) |
| 23 | | ssgt0sr.2 |
. . . . . . . . . 10
⊢ B
∈ V |
| 24 | 23 | sqgt0sr 4009 |
. . . . . . . . 9
⊢ (B
∈ R → (¬ B =
0R → 0R
<R (B
·R B))) |
| 25 | 2, 24 | im2anan9 434 |
. . . . . . . 8
⊢ ((A
∈ R ∧ B ∈
R) → ((¬ A =
0R ∧ ¬ B =
0R) → (0R
<R (A
·R A) ∧
0R <R (B ·R B)))) |
| 26 | | oprex 3018 |
. . . . . . . . 9
⊢ (A
·R A)
∈ V |
| 27 | | oprex 3018 |
. . . . . . . . 9
⊢ (B
·R B)
∈ V |
| 28 | 26, 27 | addgt0sr 4007 |
. . . . . . . 8
⊢ ((0R
<R (A
·R A) ∧
0R <R (B ·R B)) → 0R
<R ((A
·R A)
+R (B
·R B))) |
| 29 | 25, 28 | syl6 23 |
. . . . . . 7
⊢ ((A
∈ R ∧ B ∈
R) → ((¬ A =
0R ∧ ¬ B =
0R) → 0R
<R ((A
·R A)
+R (B
·R B)))) |
| 30 | 29 | exp3a 292 |
. . . . . 6
⊢ ((A
∈ R ∧ B ∈
R) → (¬ A =
0R → (¬ B
= 0R → 0R
<R ((A
·R A)
+R (B
·R B))))) |
| 31 | 30 | com3l 34 |
. . . . 5
⊢ (¬ A = 0R → (¬
B = 0R →
((A ∈ R ∧ B ∈ R) →
0R <R ((A ·R A) +R (B ·R B))))) |
| 32 | 22, 31 | pm2.61d 112 |
. . . 4
⊢ (¬ A = 0R → ((A ∈ R ∧ B ∈ R) →
0R <R ((A ·R A) +R (B ·R B)))) |
| 33 | 32 | com12 13 |
. . 3
⊢ ((A
∈ R ∧ B ∈
R) → (¬ A =
0R → 0R
<R ((A
·R A)
+R (B
·R B)))) |
| 34 | 24 | imp 277 |
. . . . . . . 8
⊢ ((B
∈ R ∧ ¬ B =
0R) → 0R
<R (B
·R B)) |
| 35 | 34 | adantrl 311 |
. . . . . . 7
⊢ ((B
∈ R ∧ (A =
0R ∧ ¬ B =
0R)) → 0R
<R (B
·R B)) |
| 36 | | opreq12 3008 |
. . . . . . . . . . . . 13
⊢ ((A =
0R ∧ A =
0R) → (A
·R A) =
(0R ·R
0R)) |
| 37 | 36 | anidms 332 |
. . . . . . . . . . . 12
⊢ (A =
0R → (A
·R A) =
(0R ·R
0R)) |
| 38 | 37, 9 | syl6eq 1140 |
. . . . . . . . . . 11
⊢ (A =
0R → (A
·R A) =
0R) |
| 39 | 38 | opreq1d 3012 |
. . . . . . . . . 10
⊢ (A =
0R → ((A
·R A)
+R (B
·R B)) =
(0R +R (B ·R B))) |
| 40 | | mulclsr 3987 |
. . . . . . . . . . . 12
⊢ ((B
∈ R ∧ B ∈
R) → (B
·R B)
∈ R) |
| 41 | 40 | anidms 332 |
. . . . . . . . . . 11
⊢ (B
∈ R → (B
·R B)
∈ R) |
| 42 | | 0idsr 4000 |
. . . . . . . . . . . 12
⊢ ((B
·R B)
∈ R → ((B
·R B)
+R 0R) = (B ·R B)) |
| 43 | 7 | elisseti 1355 |
. . . . . . . . . . . . 13
⊢ 0R ∈
V |
| 44 | 43, 27 | addcomsr 3990 |
. . . . . . . . . . . 12
⊢ (0R
+R (B
·R B)) =
((B ·R
B) +R
0R) |
| 45 | 42, 44 | syl5eq 1136 |
. . . . . . . . . . 11
⊢ ((B
·R B)
∈ R → (0R
+R (B
·R B)) =
(B ·R
B)) |
| 46 | 41, 45 | syl 12 |
. . . . . . . . . 10
⊢ (B
∈ R → (0R
+R (B
·R B)) =
(B ·R
B)) |
| 47 | 39, 46 | sylan9eqr 1145 |
. . . . . . . . 9
⊢ ((B
∈ R ∧ A =
0R) → ((A
·R A)
+R (B
·R B)) =
(B ·R
B)) |
| 48 | 47 | breq2d 2072 |
. . . . . . . 8
⊢ ((B
∈ R ∧ A =
0R) → (0R
<R ((A
·R A)
+R (B
·R B))
↔ 0R <R (B ·R B))) |
| 49 | 48 | adantrr 312 |
. . . . . . 7
⊢ ((B
∈ R ∧ (A =
0R ∧ ¬ B =
0R)) → (0R
<R ((A
·R A)
+R (B
·R B))
↔ 0R <R (B ·R B))) |
| 50 | 35, 49 | mpbird 171 |
. . . . . 6
⊢ ((B
∈ R ∧ (A =
0R ∧ ¬ B =
0R)) → 0R
<R ((A
·R A)
+R (B
·R B))) |
| 51 | 50 | adantll 309 |
. . . . 5
⊢ (((A
∈ R ∧ B ∈
R) ∧ (A =
0R ∧ ¬ B =
0R)) → 0R
<R ((A
·R A)
+R (B
·R B))) |
| 52 | 51 | exp32 294 |
. . . 4
⊢ ((A
∈ R ∧ B ∈
R) → (A =
0R → (¬ B
= 0R → 0R
<R ((A
·R A)
+R (B
·R B))))) |
| 53 | 52, 30 | pm2.61d 112 |
. . 3
⊢ ((A
∈ R ∧ B ∈
R) → (¬ B =
0R → 0R
<R ((A
·R A)
+R (B
·R B)))) |
| 54 | 33, 53 | jaod 329 |
. 2
⊢ ((A
∈ R ∧ B ∈
R) → ((¬ A =
0R ∨ ¬ B =
0R) → 0R
<R ((A
·R A)
+R (B
·R B)))) |
| 55 | | ianor 253 |
. 2
⊢ (¬ (A = 0R ∧ B = 0R) ↔ (¬
A = 0R ∨ ¬
B = 0R)) |
| 56 | 54, 55 | syl5ib 181 |
1
⊢ ((A
∈ R ∧ B ∈
R) → (¬ (A =
0R ∧ B =
0R) → 0R
<R ((A
·R A)
+R (B
·R B)))) |