Theorem sticl 29992

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 29990	. . 3 ⊢ (𝑆 ∈ States ↔ (𝑆: Cℋ ⟶(0[,]1) ∧ (𝑆‘ ℋ) = 1 ∧ ∀𝑥 ∈ Cℋ ∀𝑦 ∈ Cℋ (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 ∨ℋ 𝑦)) = ((𝑆‘𝑥) + (𝑆‘𝑦)))))
2	1	simp1bi 1141	. 2 ⊢ (𝑆 ∈ States → 𝑆: Cℋ ⟶(0[,]1))
3		ffvelrn 6849	. . 3 ⊢ ((𝑆: Cℋ ⟶(0[,]1) ∧ 𝐴 ∈ Cℋ ) → (𝑆‘𝐴) ∈ (0[,]1))
4	3	ex 415	. 2 ⊢ (𝑆: Cℋ ⟶(0[,]1) → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ (0[,]1)))
5	2, 4	syl 17	1 ⊢ (𝑆 ∈ States → (𝐴 ∈ Cℋ → (𝑆‘𝐴) ∈ (0[,]1)))

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2114  ∀wral 3138   ⊆ wss 3936  ⟶wf 6351  ‘cfv 6355  (class class class)co 7156  0cc0 10537  1c1 10538   + caddc 10540  [,]cicc 12742   ℋchba 28696   C_ℋ cch 28706  ⊥cort 28707   ∨_ℋ chj 28710  Statescst 28739

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-hilex 28776

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161  df-map 8408  df-sh 28984  df-ch 28998  df-st 29988

This theorem is referenced by:  stcl  29993  stge0  30001  stle1  30002