HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  isst Structured version   Visualization version   GIF version

Theorem isst 31453
Description: Property of a state. (Contributed by NM, 23-Oct-1999.) (Revised by Mario Carneiro, 23-Dec-2013.) (New usage is discouraged.)
Assertion
Ref Expression
isst (𝑆 ∈ States ↔ (𝑆: C ⟶(0[,]1) ∧ (𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))))
Distinct variable group:   𝑥,𝑦,𝑆

Proof of Theorem isst
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 ovex 7438 . . . 4 (0[,]1) ∈ V
2 chex 30466 . . . 4 C ∈ V
31, 2elmap 8861 . . 3 (𝑆 ∈ ((0[,]1) ↑m C ) ↔ 𝑆: C ⟶(0[,]1))
43anbi1i 624 . 2 ((𝑆 ∈ ((0[,]1) ↑m C ) ∧ ((𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))) ↔ (𝑆: C ⟶(0[,]1) ∧ ((𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))))
5 fveq1 6887 . . . . 5 (𝑓 = 𝑆 → (𝑓‘ ℋ) = (𝑆‘ ℋ))
65eqeq1d 2734 . . . 4 (𝑓 = 𝑆 → ((𝑓‘ ℋ) = 1 ↔ (𝑆‘ ℋ) = 1))
7 fveq1 6887 . . . . . . 7 (𝑓 = 𝑆 → (𝑓‘(𝑥 𝑦)) = (𝑆‘(𝑥 𝑦)))
8 fveq1 6887 . . . . . . . 8 (𝑓 = 𝑆 → (𝑓𝑥) = (𝑆𝑥))
9 fveq1 6887 . . . . . . . 8 (𝑓 = 𝑆 → (𝑓𝑦) = (𝑆𝑦))
108, 9oveq12d 7423 . . . . . . 7 (𝑓 = 𝑆 → ((𝑓𝑥) + (𝑓𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))
117, 10eqeq12d 2748 . . . . . 6 (𝑓 = 𝑆 → ((𝑓‘(𝑥 𝑦)) = ((𝑓𝑥) + (𝑓𝑦)) ↔ (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))
1211imbi2d 340 . . . . 5 (𝑓 = 𝑆 → ((𝑥 ⊆ (⊥‘𝑦) → (𝑓‘(𝑥 𝑦)) = ((𝑓𝑥) + (𝑓𝑦))) ↔ (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))))
13122ralbidv 3218 . . . 4 (𝑓 = 𝑆 → (∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑓‘(𝑥 𝑦)) = ((𝑓𝑥) + (𝑓𝑦))) ↔ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))))
146, 13anbi12d 631 . . 3 (𝑓 = 𝑆 → (((𝑓‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑓‘(𝑥 𝑦)) = ((𝑓𝑥) + (𝑓𝑦)))) ↔ ((𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))))
15 df-st 31451 . . 3 States = {𝑓 ∈ ((0[,]1) ↑m C ) ∣ ((𝑓‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑓‘(𝑥 𝑦)) = ((𝑓𝑥) + (𝑓𝑦))))}
1614, 15elrab2 3685 . 2 (𝑆 ∈ States ↔ (𝑆 ∈ ((0[,]1) ↑m C ) ∧ ((𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))))
17 3anass 1095 . 2 ((𝑆: C ⟶(0[,]1) ∧ (𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))) ↔ (𝑆: C ⟶(0[,]1) ∧ ((𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))))
184, 16, 173bitr4i 302 1 (𝑆 ∈ States ↔ (𝑆: C ⟶(0[,]1) ∧ (𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3061  wss 3947  wf 6536  cfv 6540  (class class class)co 7405  m cmap 8816  0cc0 11106  1c1 11107   + caddc 11109  [,]cicc 13323  chba 30159   C cch 30169  cort 30170   chj 30173  Statescst 30202
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-hilex 30239
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8818  df-sh 30447  df-ch 30461  df-st 31451
This theorem is referenced by:  sticl  31455  sthil  31474  stj  31475  strlem3a  31492
  Copyright terms: Public domain W3C validator