Theorem sticl 29998

Description: [0, 1] closure of the value of a state. (Contributed by Mario Carneiro, 23-Dec-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
sticl	⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ (0[,]1)))

Proof of Theorem sticl

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isst 29996	. . 3 ⊢ (𝑆 ∈ States ↔ (𝑆: Cℋ ⟶(0[,]1) ∧ (𝑆‘ ℋ) = 1 ∧ ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) + (𝑆‘𝑦)))))
2	1	simp1bi 1142	. 2 ⊢ (𝑆 ∈ States → 𝑆: Cℋ ⟶(0[,]1))
3		ffvelrn 6826	. . 3 ⊢ ((𝑆: Cℋ ⟶(0[,]1) ∧ 𝐴 ∈ Cℋ ) → (𝑆‘𝐴) ∈ (0[,]1))
4	3	ex 416	. 2 ⊢ (𝑆: Cℋ ⟶(0[,]1) → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ (0[,]1)))
5	2, 4	syl 17	1 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ (0[,]1)))

Syntax hints:   → wi 4   = wceq 1538   ∈ wcel 2111  ∀wral 3106   ⊆ wss 3881  ⟶wf 6320  ‘cfv 6324  (class class class)co 7135  0cc0 10526  1c1 10527   + caddc 10529  [,]cicc 12729   ℋchba 28702   C_ℋ cch 28712  ⊥cort 28713   ∨_ℋ chj 28716  Statescst 28745

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-hilex 28782

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-map 8391  df-sh 28990  df-ch 29004  df-st 29994

This theorem is referenced by:  stcl  29999  stge0  30007  stle1  30008