Theorem stel 11786

Description: Property of a state.

Assertion

Ref	Expression
stel	|- (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 C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))))

Distinct variable group:   x,y,S

Proof of Theorem stel

Step	Hyp	Ref	Expression
1		elisset 2299	. 2 |- (S e. States -> S e. _V)
2		chex 10728	. . . 4 |- CH e. _V
3		fex 4595	. . . 4 |- ((S:CH-->RR /\ CH e. _V) -> S e. _V)
4	2, 3	mpan2 760	. . 3 |- (S:CH-->RR -> S e. _V)
5	4	ad2antrr 440	. 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 C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))) -> S e. _V)
6		feq1 4551	. . . . 5 |- (f = S -> (f:CH-->RR <-> S:CH-->RR))
7		fveq1 4680	. . . . . . . 8 |- (f = S -> (f` x) = (S` x))
8	7	breq2d 3350	. . . . . . 7 |- (f = S -> (0 <_ (f` x) <-> 0 <_ (S` x)))
9	7	breq1d 3348	. . . . . . 7 |- (f = S -> ((f` x) <_ 1 <-> (S` x) <_ 1))
10	8, 9	anbi12d 690	. . . . . 6 |- (f = S -> ((0 <_ (f` x) /\ (f` x) <_ 1) <-> (0 <_ (S` x) /\ (S` x) <_ 1)))
11	10	ralbidv 2123	. . . . 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 690	. . . 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 4680	. . . . . 6 |- (f = S -> (f` ~H) = (S` ~H))
14	13	eqeq1d 1892	. . . . 5 |- (f = S -> ((f` ~H) = 1 <-> (S` ~H) = 1))
15		fveq1 4680	. . . . . . . 8 |- (f = S -> (f` (x vH y)) = (S` (x vH y)))
16		fveq1 4680	. . . . . . . . 9 |- (f = S -> (f` y) = (S` y))
17	7, 16	opreq12d 4900	. . . . . . . 8 |- (f = S -> ((f` x) + (f` y)) = ((S` x) + (S` y)))
18	15, 17	eqeq12d 1899	. . . . . . 7 |- (f = S -> ((f` (x vH y)) = ((f` x) + (f` y)) <-> (S` (x vH y)) = ((S` x) + (S` y))))
19	18	imbi2d 674	. . . . . 6 |- (f = S -> ((x C_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y))) <-> (x C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))
20	19	2ralbidv 2140	. . . . 5 |- (f = S -> (A.x e. CH A.y e. CH (x C_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y))) <-> A.x e. CH A.y e. CH (x C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))
21	14, 20	anbi12d 690	. . . 4 |- (f = S -> (((f` ~H) = 1 /\ A.x e. CH A.y e. CH (x C_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y)))) <-> ((S` ~H) = 1 /\ A.x e. CH A.y e. CH (x C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))))
22	12, 21	anbi12d 690	. . 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 C_ (_|_` 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 C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))))
23		df-st 11784	. . 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 C_ (_|_` y) -> (f` (x vH y)) = ((f` x) + (f` y)))))}
24	22, 23	elab2g 2406	. 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 C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y)))))))
25	1, 5, 24	pm5.21nii 743	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 C_ (_|_` y) -> (S` (x vH y)) = ((S` x) + (S` y))))))

Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240   = wceq 1298   e. wcel 1300  A.wral 2105  _Vcvv 2292   C_ wss 2593   class class class wbr 3338  -->wf 3994  ` cfv 3998  (class class class)co 4884  RRcr 6385  0cc0 6386  1c1 6387   + caddc 6389   <_ cle 6448  ~Hchil 10420  CHcch 10430  _|_cort 10431   vH chj 10434  Statescst 10463

This theorem is referenced by:  stcl 11788  stge0 11796  stle1 11797  sthil 11806  stj 11807  strlem3a 11824

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-rep 3428  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524  ax-un 3790  ax-hilex 10501

This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-id 3586  df-xp 4000  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fun 4008  df-fn 4009  df-f 4010  df-fv 4014  df-opr 4886  df-sh 10709  df-ch 10725  df-st 11784

Copyright terms: Public domain