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

Theorem stj 30004
 Description: The value of a state on a join. (Contributed by NM, 23-Oct-1999.) (New usage is discouraged.)
Assertion
Ref Expression
stj (𝑆 ∈ States → (((𝐴C𝐵C ) ∧ 𝐴 ⊆ (⊥‘𝐵)) → (𝑆‘(𝐴 𝐵)) = ((𝑆𝐴) + (𝑆𝐵))))

Proof of Theorem stj
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isst 29982 . . . 4 (𝑆 ∈ States ↔ (𝑆: C ⟶(0[,]1) ∧ (𝑆‘ ℋ) = 1 ∧ ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)))))
21simp3bi 1142 . . 3 (𝑆 ∈ States → ∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))))
3 sseq1 3990 . . . . 5 (𝑥 = 𝐴 → (𝑥 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝑦)))
4 fvoveq1 7171 . . . . . 6 (𝑥 = 𝐴 → (𝑆‘(𝑥 𝑦)) = (𝑆‘(𝐴 𝑦)))
5 fveq2 6663 . . . . . . 7 (𝑥 = 𝐴 → (𝑆𝑥) = (𝑆𝐴))
65oveq1d 7163 . . . . . 6 (𝑥 = 𝐴 → ((𝑆𝑥) + (𝑆𝑦)) = ((𝑆𝐴) + (𝑆𝑦)))
74, 6eqeq12d 2835 . . . . 5 (𝑥 = 𝐴 → ((𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦)) ↔ (𝑆‘(𝐴 𝑦)) = ((𝑆𝐴) + (𝑆𝑦))))
83, 7imbi12d 347 . . . 4 (𝑥 = 𝐴 → ((𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))) ↔ (𝐴 ⊆ (⊥‘𝑦) → (𝑆‘(𝐴 𝑦)) = ((𝑆𝐴) + (𝑆𝑦)))))
9 fveq2 6663 . . . . . 6 (𝑦 = 𝐵 → (⊥‘𝑦) = (⊥‘𝐵))
109sseq2d 3997 . . . . 5 (𝑦 = 𝐵 → (𝐴 ⊆ (⊥‘𝑦) ↔ 𝐴 ⊆ (⊥‘𝐵)))
11 oveq2 7156 . . . . . . 7 (𝑦 = 𝐵 → (𝐴 𝑦) = (𝐴 𝐵))
1211fveq2d 6667 . . . . . 6 (𝑦 = 𝐵 → (𝑆‘(𝐴 𝑦)) = (𝑆‘(𝐴 𝐵)))
13 fveq2 6663 . . . . . . 7 (𝑦 = 𝐵 → (𝑆𝑦) = (𝑆𝐵))
1413oveq2d 7164 . . . . . 6 (𝑦 = 𝐵 → ((𝑆𝐴) + (𝑆𝑦)) = ((𝑆𝐴) + (𝑆𝐵)))
1512, 14eqeq12d 2835 . . . . 5 (𝑦 = 𝐵 → ((𝑆‘(𝐴 𝑦)) = ((𝑆𝐴) + (𝑆𝑦)) ↔ (𝑆‘(𝐴 𝐵)) = ((𝑆𝐴) + (𝑆𝐵))))
1610, 15imbi12d 347 . . . 4 (𝑦 = 𝐵 → ((𝐴 ⊆ (⊥‘𝑦) → (𝑆‘(𝐴 𝑦)) = ((𝑆𝐴) + (𝑆𝑦))) ↔ (𝐴 ⊆ (⊥‘𝐵) → (𝑆‘(𝐴 𝐵)) = ((𝑆𝐴) + (𝑆𝐵)))))
178, 16rspc2v 3631 . . 3 ((𝐴C𝐵C ) → (∀𝑥C𝑦C (𝑥 ⊆ (⊥‘𝑦) → (𝑆‘(𝑥 𝑦)) = ((𝑆𝑥) + (𝑆𝑦))) → (𝐴 ⊆ (⊥‘𝐵) → (𝑆‘(𝐴 𝐵)) = ((𝑆𝐴) + (𝑆𝐵)))))
182, 17syl5com 31 . 2 (𝑆 ∈ States → ((𝐴C𝐵C ) → (𝐴 ⊆ (⊥‘𝐵) → (𝑆‘(𝐴 𝐵)) = ((𝑆𝐴) + (𝑆𝐵)))))
1918impd 413 1 (𝑆 ∈ States → (((𝐴C𝐵C ) ∧ 𝐴 ⊆ (⊥‘𝐵)) → (𝑆‘(𝐴 𝐵)) = ((𝑆𝐴) + (𝑆𝐵))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 398   = wceq 1531   ∈ wcel 2108  ∀wral 3136   ⊆ wss 3934  ⟶wf 6344  ‘cfv 6348  (class class class)co 7148  0cc0 10529  1c1 10530   + caddc 10532  [,]cicc 12733   ℋchba 28688   Cℋ cch 28698  ⊥cort 28699   ∨ℋ chj 28702  Statescst 28731 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-hilex 28768 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  df-uni 4831  df-br 5058  df-opab 5120  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-map 8400  df-sh 28976  df-ch 28990  df-st 29980 This theorem is referenced by:  sto1i  30005  stlei  30009  stji1i  30011
 Copyright terms: Public domain W3C validator