Theorem stelt 10141

Description: Property of a state.

Assertion

Ref	Expression
stelt	|- (S e. States <-> ((S:CH-->RR /\ A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1)) /\ ((S` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))))

Distinct variable group:   x,y,S

Proof of Theorem stelt

Step	Hyp	Ref	Expression
1		elisset 1817	. 2 |- (S e. States -> S e. V)
2		chex 9095	. . . 4 |- CH e. V
3		fex 3652	. . . 4 |- ((S:CH-->RR /\ CH e. V) -> S e. V)
4	2, 3	mpan2 696	. . 3 |- (S:CH-->RR -> S e. V)
5	4	ad2antrr 404	. 2 |- (((S:CH-->RR /\ A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1)) /\ ((S` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))) -> S e. V)
6		feq1 3620	. . . . 5 |- (f = S -> (f:CH-->RR <-> S:CH-->RR))
7		fveq1 3723	. . . . . . . 8 |- (f = S -> (f` x) = (S` x))
8	7	breq2d 2630	. . . . . . 7 |- (f = S -> (0 <_ (f` x) <-> 0 <_ (S` x)))
9	7	breq1d 2629	. . . . . . 7 |- (f = S -> ((f` x) <_ 1 <-> (S` x) <_ 1))
10	8, 9	anbi12d 628	. . . . . 6 |- (f = S -> ((0 <_ (f` x) /\ (f` x) <_ 1) <-> (0 <_ (S` x) /\ (S` x) <_ 1)))
11	10	ralbidv 1663	. . . . 5 |- (f = S -> (A.x e. CH (0 <_ (f` x) /\ (f` x) <_ 1) <-> A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1)))
12	6, 11	anbi12d 628	. . . 4 |- (f = S -> ((f:CH-->RR /\ A.x e. CH (0 <_ (f` x) /\ (f` x) <_ 1)) <-> (S:CH-->RR /\ A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1))))
13		fveq1 3723	. . . . . 6 |- (f = S -> (f` H~) = (S` H~))
14	13	eqeq1d 1483	. . . . 5 |- (f = S -> ((f` H~) = 1 <-> (S` H~) = 1))
15		fveq1 3723	. . . . . . . 8 |- (f = S -> (f` (x vH y)) = (S` (x vH y)))
16		fveq1 3723	. . . . . . . . 9 |- (f = S -> (f` y) = (S` y))
17	7, 16	opreq12d 3978	. . . . . . . 8 |- (f = S -> ((f` x) + (f` y)) = ((S` x) + (S` y)))
18	15, 17	eqeq12d 1489	. . . . . . 7 |- (f = S -> ((f` (x vH y)) = ((f` x) + (f` y)) <-> (S` (x vH y)) = ((S` x) + (S` y))))
19	18	imbi2d 612	. . . . . 6 |- (f = S -> ((x (_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y))) <-> (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))
20	19	2ralbidv 1680	. . . . 5 |- (f = S -> (A.x e. CH A.y e. CH (x (_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y))) <-> A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))
21	14, 20	anbi12d 628	. . . 4 |- (f = S -> (((f` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y)))) <-> ((S` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))))
22	12, 21	anbi12d 628	. . 3 |- (f = S -> (((f:CH-->RR /\ A.x e. CH (0 <_ (f` x) /\ (f` x) <_ 1)) /\ ((f` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y))))) <-> ((S:CH-->RR /\ A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1)) /\ ((S` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))))
23		df-st 10139	. . 3 |- States = {f | ((f:CH-->RR /\ A.x e. CH (0 <_ (f` x) /\ (f` x) <_ 1)) /\ ((f` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y)))))}
24	22, 23	elab2g 1900	. 2 |- (S e. V -> (S e. States <-> ((S:CH-->RR /\ A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1)) /\ ((S` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))))
25	1, 5, 24	pm5.21nii 679	1 |- (S e. States <-> ((S:CH-->RR /\ A.x e. CH (0 <_ (S` x) /\ (S` x) <_ 1)) /\ ((S` H~) = 1 /\ A.x e. CH A.y e. CH (x (_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))))

Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   e. wcel 958  A.wral 1645  Vcvv 1811   (_ wss 2047   class class class wbr 2619  -->wf 3178  ` cfv 3182  (class class class)co 3963  RRcr 5233  0cc0 5234  1c1 5235   + caddc 5237   <_ cle 5295  H~chil 8788  CHcch 8798  _|_cort 8799   vH chj 8802  Statescst 8831

This theorem is referenced by:  stclt 10143  stge0t 10151  stle1t 10152  sthil 10161  stjt 10162  strlem3a 10179

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-rep 2693  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866  ax-hilex 8869

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-id 2835  df-xp 3184  df-rel 3185  df-cnv 3186  df-co 3187  df-dm 3188  df-rn 3189  df-res 3190  df-ima 3191  df-fun 3192  df-fn 3193  df-f 3194  df-fv 3198  df-opr 3965  df-sh 9076  df-ch 9092  df-st 10139

Copyright terms: Public domain