Proof of Theorem hst1ht
| Step | Hyp | Ref
| Expression |
| 1 | | hstclt 10152 |
. . . . . . . . . . . . . . 15
⊢ ((S ∈ CHStates ⋀ (⊥
‘A) ∈ Cℋ ) → (S ‘(⊥
‘A)) ∈ ℋ ) |
| 2 | | chocclt 9191 |
. . . . . . . . . . . . . . 15
⊢ (A ∈ Cℋ → (⊥ ‘A)
∈ Cℋ ) |
| 3 | 1, 2 | sylan2 454 |
. . . . . . . . . . . . . 14
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) → (S ‘(⊥
‘A)) ∈ ℋ ) |
| 4 | | normclt 8998 |
. . . . . . . . . . . . . 14
⊢ ((S ‘(⊥
‘A)) ∈ ℋ →
(normh ‘(S
‘(⊥ ‘A))) ∈ ℝ) |
| 5 | 3, 4 | syl 10 |
. . . . . . . . . . . . 13
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
(normh ‘(S
‘(⊥ ‘A))) ∈ ℝ) |
| 6 | | resqclt 6634 |
. . . . . . . . . . . . 13
⊢ ((normh
‘(S ‘(⊥ ‘A)))
∈ ℝ →
((normh ‘(S
‘(⊥ ‘A)))↑2) ∈
ℝ) |
| 7 | 5, 6 | syl 10 |
. . . . . . . . . . . 12
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
((normh ‘(S
‘(⊥ ‘A)))↑2) ∈
ℝ) |
| 8 | 7 | recnd 5328 |
. . . . . . . . . . 11
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
((normh ‘(S
‘(⊥ ‘A)))↑2) ∈
ℂ) |
| 9 | | ax1cn 5282 |
. . . . . . . . . . . 12
⊢ 1 ∈ ℂ |
| 10 | | pncan2t 5411 |
. . . . . . . . . . . 12
⊢ ((1 ∈ ℂ ⋀ ((normh ‘(S ‘(⊥
‘A)))↑2) ∈ ℂ) → ((1
+ ((normh ‘(S
‘(⊥ ‘A)))↑2)) − 1) = ((normh
‘(S ‘(⊥ ‘A)))↑2)) |
| 11 | 9, 10 | mpan 699 |
. . . . . . . . . . 11
⊢ (((normh
‘(S ‘(⊥ ‘A)))↑2) ∈
ℂ → ((1 + ((normh
‘(S ‘(⊥ ‘A)))↑2)) − 1) = ((normh
‘(S ‘(⊥ ‘A)))↑2)) |
| 12 | 8, 11 | syl 10 |
. . . . . . . . . 10
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) → ((1 +
((normh ‘(S
‘(⊥ ‘A)))↑2)) − 1) = ((normh
‘(S ‘(⊥ ‘A)))↑2)) |
| 13 | 12 | adantr 391 |
. . . . . . . . 9
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((1 + ((normh ‘(S ‘(⊥
‘A)))↑2)) − 1) =
((normh ‘(S
‘(⊥ ‘A)))↑2)) |
| 14 | | opreq1 3982 |
. . . . . . . . . . . . 13
⊢ ((normh
‘(S ‘A)) = 1 → ((normh
‘(S ‘A))↑2) = (1↑2)) |
| 15 | | sq1 6650 |
. . . . . . . . . . . . 13
⊢ (1↑2) = 1 |
| 16 | 14, 15 | syl6req 1531 |
. . . . . . . . . . . 12
⊢ ((normh
‘(S ‘A)) = 1 → 1 = ((normh
‘(S ‘A))↑2)) |
| 17 | 16 | opreq1d 3989 |
. . . . . . . . . . 11
⊢ ((normh
‘(S ‘A)) = 1 → (1 + ((normh
‘(S ‘(⊥ ‘A)))↑2)) = (((normh
‘(S ‘A))↑2) + ((normh
‘(S ‘(⊥ ‘A)))↑2))) |
| 18 | | hstnmoct 10158 |
. . . . . . . . . . 11
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
(((normh ‘(S
‘A))↑2) +
((normh ‘(S
‘(⊥ ‘A)))↑2)) = 1) |
| 19 | 17, 18 | sylan9eqr 1536 |
. . . . . . . . . 10
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → (1 + ((normh ‘(S ‘(⊥
‘A)))↑2)) = 1) |
| 20 | 19 | opreq1d 3989 |
. . . . . . . . 9
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((1 + ((normh ‘(S ‘(⊥
‘A)))↑2)) − 1) = (1
− 1)) |
| 21 | 13, 20 | eqtr3d 1516 |
. . . . . . . 8
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((normh ‘(S ‘(⊥
‘A)))↑2) = (1 −
1)) |
| 22 | 9 | subid 5404 |
. . . . . . . 8
⊢ (1 − 1) =
0 |
| 23 | 21, 22 | syl6eq 1530 |
. . . . . . 7
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((normh ‘(S ‘(⊥
‘A)))↑2) = 0) |
| 24 | 23 | ex 373 |
. . . . . 6
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
((normh ‘(S
‘A)) = 1 →
((normh ‘(S
‘(⊥ ‘A)))↑2) = 0)) |
| 25 | 5 | recnd 5328 |
. . . . . . . 8
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
(normh ‘(S
‘(⊥ ‘A))) ∈ ℂ) |
| 26 | | sqeq0t 6626 |
. . . . . . . 8
⊢ ((normh
‘(S ‘(⊥ ‘A)))
∈ ℂ →
(((normh ‘(S
‘(⊥ ‘A)))↑2) = 0 ↔ (normh
‘(S ‘(⊥ ‘A)))
= 0)) |
| 27 | 25, 26 | syl 10 |
. . . . . . 7
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
(((normh ‘(S
‘(⊥ ‘A)))↑2) = 0 ↔ (normh
‘(S ‘(⊥ ‘A)))
= 0)) |
| 28 | | norm-it 9003 |
. . . . . . . 8
⊢ ((S ‘(⊥
‘A)) ∈ ℋ →
((normh ‘(S
‘(⊥ ‘A))) = 0 ↔ (S ‘(⊥
‘A)) =
0h)) |
| 29 | 3, 28 | syl 10 |
. . . . . . 7
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
((normh ‘(S
‘(⊥ ‘A))) = 0 ↔ (S ‘(⊥
‘A)) =
0h)) |
| 30 | 27, 29 | bitrd 531 |
. . . . . 6
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
(((normh ‘(S
‘(⊥ ‘A)))↑2) = 0 ↔ (S ‘(⊥
‘A)) =
0h)) |
| 31 | 24, 30 | sylibd 202 |
. . . . 5
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
((normh ‘(S
‘A)) = 1 → (S ‘(⊥
‘A)) =
0h)) |
| 32 | 31 | imp 350 |
. . . 4
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → (S ‘(⊥ ‘A)) =
0h) |
| 33 | 32 | opreq2d 3990 |
. . 3
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((S ‘A) +h (S ‘(⊥
‘A))) = ((S ‘A)
+h 0h)) |
| 34 | | hstoct 10157 |
. . . 4
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) → ((S ‘A)
+h (S ‘(⊥ ‘A)))
= (S ‘ ℋ )) |
| 35 | 34 | adantr 391 |
. . 3
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((S ‘A) +h (S ‘(⊥
‘A))) = (S ‘ ℋ
)) |
| 36 | | hstclt 10152 |
. . . . 5
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) → (S ‘A)
∈ ℋ
) |
| 37 | | ax-hvaddid 8881 |
. . . . 5
⊢ ((S ‘A)
∈ ℋ →
((S ‘A) +h 0h) =
(S ‘A)) |
| 38 | 36, 37 | syl 10 |
. . . 4
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) → ((S ‘A)
+h 0h) = (S ‘A)) |
| 39 | 38 | adantr 391 |
. . 3
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → ((S ‘A) +h 0h) =
(S ‘A)) |
| 40 | 33, 35, 39 | 3eqtr3rd 1523 |
. 2
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (normh ‘(S ‘A)) =
1) → (S ‘A) = (S ‘
ℋ )) |
| 41 | | fveq2 3738 |
. . 3
⊢ ((S ‘A) =
(S ‘ ℋ ) → (normh
‘(S ‘A)) = (normh ‘(S ‘ ℋ
))) |
| 42 | | hst1t 10153 |
. . . 4
⊢ (S ∈ CHStates
→ (normh ‘(S
‘ ℋ )) = 1) |
| 43 | 42 | adantr 391 |
. . 3
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
(normh ‘(S ‘
ℋ )) = 1) |
| 44 | 41, 43 | sylan9eqr 1536 |
. 2
⊢ (((S ∈ CHStates ⋀ A ∈ Cℋ ) ⋀ (S
‘A) = (S ‘ ℋ ))
→ (normh ‘(S
‘A)) = 1) |
| 45 | 40, 44 | impbida 522 |
1
⊢ ((S ∈ CHStates ⋀ A ∈ Cℋ ) →
((normh ‘(S
‘A)) = 1 ↔ (S ‘A) =
(S ‘ ℋ ))) |