Proof of Theorem stelt
| Step | Hyp | Ref
| Expression |
| 1 | | elisset 1820 |
. 2
⊢ (S ∈ States →
S ∈
V) |
| 2 | | chex 9090 |
. . . 4
⊢ Cℋ ∈ V |
| 3 | | fex 3658 |
. . . 4
⊢ ((S: Cℋ –→ℝ ⋀ Cℋ ∈ V) → S ∈
V) |
| 4 | 2, 3 | mpan2 698 |
. . 3
⊢ (S: Cℋ –→ℝ → S
∈ V) |
| 5 | 4 | ad2antrr 406 |
. 2
⊢ (((S: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (S ‘x)
⋀ (S
‘x) ≤ 1)) ⋀ ((S ‘
ℋ ) = 1 ⋀
∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y)))))
→ S ∈ V) |
| 6 | | feq1 3626 |
. . . . 5
⊢ (f = S →
(f: Cℋ –→ℝ ↔ S:
Cℋ –→ℝ)) |
| 7 | | fveq1 3729 |
. . . . . . . 8
⊢ (f = S →
(f ‘x) = (S
‘x)) |
| 8 | 7 | breq2d 2635 |
. . . . . . 7
⊢ (f = S → (0
≤ (f ‘x) ↔ 0 ≤ (S ‘x))) |
| 9 | 7 | breq1d 2634 |
. . . . . . 7
⊢ (f = S →
((f ‘x) ≤ 1 ↔ (S ‘x) ≤
1)) |
| 10 | 8, 9 | anbi12d 630 |
. . . . . 6
⊢ (f = S → ((0
≤ (f ‘x) ⋀ (f ‘x) ≤
1) ↔ (0 ≤ (S ‘x) ⋀ (S ‘x) ≤
1))) |
| 11 | 10 | ralbidv 1666 |
. . . . 5
⊢ (f = S →
(∀x
∈ Cℋ (0 ≤ (f ‘x)
⋀ (f
‘x) ≤ 1) ↔ ∀x ∈ Cℋ (0 ≤ (S ‘x)
⋀ (S
‘x) ≤ 1))) |
| 12 | 6, 11 | anbi12d 630 |
. . . 4
⊢ (f = S →
((f: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (f ‘x)
⋀ (f
‘x) ≤ 1)) ↔ (S: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (S ‘x)
⋀ (S
‘x) ≤ 1)))) |
| 13 | | fveq1 3729 |
. . . . . 6
⊢ (f = S →
(f ‘ ℋ ) = (S
‘ ℋ )) |
| 14 | 13 | eqeq1d 1486 |
. . . . 5
⊢ (f = S →
((f ‘ ℋ ) = 1 ↔ (S ‘ ℋ ) =
1)) |
| 15 | | fveq1 3729 |
. . . . . . . 8
⊢ (f = S →
(f ‘(x ∨ℋ y)) = (S
‘(x ∨ℋ y))) |
| 16 | | fveq1 3729 |
. . . . . . . . 9
⊢ (f = S →
(f ‘y) = (S
‘y)) |
| 17 | 7, 16 | opreq12d 3984 |
. . . . . . . 8
⊢ (f = S →
((f ‘x) + (f
‘y)) = ((S ‘x) +
(S ‘y))) |
| 18 | 15, 17 | eqeq12d 1492 |
. . . . . . 7
⊢ (f = S →
((f ‘(x ∨ℋ y)) = ((f
‘x) + (f ‘y))
↔ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y)))) |
| 19 | 18 | imbi2d 614 |
. . . . . 6
⊢ (f = S →
((x ⊆
(⊥ ‘y) → (f
‘(x ∨ℋ y)) = ((f
‘x) + (f ‘y)))
↔ (x ⊆ (⊥
‘y) → (S ‘(x
∨ℋ y)) = ((S
‘x) + (S ‘y))))) |
| 20 | 19 | 2ralbidv 1683 |
. . . . 5
⊢ (f = S →
(∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (f ‘(x ∨ℋ y)) = ((f
‘x) + (f ‘y)))
↔ ∀x ∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y))))) |
| 21 | 14, 20 | anbi12d 630 |
. . . 4
⊢ (f = S →
(((f ‘ ℋ ) = 1 ⋀ ∀x ∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (f ‘(x ∨ℋ y)) = ((f
‘x) + (f ‘y))))
↔ ((S ‘ ℋ ) = 1 ⋀ ∀x ∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y)))))) |
| 22 | 12, 21 | anbi12d 630 |
. . 3
⊢ (f = S →
(((f: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (f ‘x)
⋀ (f
‘x) ≤ 1)) ⋀ ((f ‘
ℋ ) = 1 ⋀
∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (f ‘(x ∨ℋ y)) = ((f
‘x) + (f ‘y)))))
↔ ((S: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (S ‘x)
⋀ (S
‘x) ≤ 1)) ⋀ ((S ‘
ℋ ) = 1 ⋀
∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y))))))) |
| 23 | | df-st 10134 |
. . 3
⊢ States = {f∣((f: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (f ‘x)
⋀ (f
‘x) ≤ 1)) ⋀ ((f ‘
ℋ ) = 1 ⋀
∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (f ‘(x ∨ℋ y)) = ((f
‘x) + (f ‘y)))))} |
| 24 | 22, 23 | elab2g 1903 |
. 2
⊢ (S ∈ V
→ (S ∈ States ↔ ((S: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (S ‘x)
⋀ (S
‘x) ≤ 1)) ⋀ ((S ‘
ℋ ) = 1 ⋀
∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y))))))) |
| 25 | 1, 5, 24 | pm5.21nii 681 |
1
⊢ (S ∈ States ↔
((S: Cℋ –→ℝ ⋀ ∀x ∈ Cℋ (0 ≤ (S ‘x)
⋀ (S
‘x) ≤ 1)) ⋀ ((S ‘
ℋ ) = 1 ⋀
∀x
∈ Cℋ ∀y ∈ Cℋ (x ⊆ (⊥ ‘y)
→ (S ‘(x ∨ℋ y)) = ((S
‘x) + (S ‘y)))))) |