HomeHome Metamath Proof Explorer < Previous   Next >
Browser slow? Try the
Unicode version.

Jump to page: Contents + 1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10682

Color key:    Metamath Proof Explorer  Metamath Proof Explorer (1-8757)   Hilbert Space Explorer  Hilbert Space Explorer (8758-10682)  

Statement List for Metamath Proof Explorer - 9301-9400 - Page 94 of 107
TypeLabelDescription
Statement
 
Theoremshscom 9301 Commutative law for subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- (A +H B) = (B +H A)
 
Theoremshsva 9302 Vector sum belongs to subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- ((C e. A /\ D e. B) -> (C +h D) e. (A +H B))
 
Theoremshsel1 9303 A subspace sum contains a member of one of its subspaces.
|- A e. SH   &   |- B e. SH   =>   |- (C e. A -> C e. (A +H B))
 
Theoremshsel2 9304 A subspace sum contains a member of one of its subspaces.
|- A e. SH   &   |- B e. SH   =>   |- (C e. B -> C e. (A +H B))
 
Theoremshsvs 9305 Vector subtraction belongs to subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- ((C e. A /\ D e. B) -> (C -h D) e. (A +H B))
 
Theoremshunss 9306 Union is smaller than subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- (A u. B) (_ (A +H B)
 
Theoremshslej 9307 Subspace sum is smaller than Hilbert lattice join. Remark in [Kalmbach] p. 65.
|- A e. SH   &   |- B e. SH   =>   |- (A +H B) (_ (A vH B)
 
Theoremshunssj 9308 Union is smaller than Hilbert lattice join.
|- A e. SH   &   |- B e. SH   =>   |- (A u. B) (_ (A vH B)
 
Theoremshjcom 9309 Commutative law for join in SH.
|- A e. SH   &   |- B e. SH   =>   |- (A vH B) = (B vH A)
 
Theoremshsub1 9310 Subspace sum is an upper bound of its arguments.
|- A e. SH   &   |- B e. SH   =>   |- A (_ (A +H B)
 
Theoremshsub2 9311 Subspace sum is an upper bound of its arguments.
|- A e. SH   &   |- B e. SH   =>   |- A (_ (B +H A)
 
Theoremshub1 9312 Hilbert lattice join is an upper bound of two subspaces.
|- A e. SH   &   |- B e. SH   =>   |- A (_ (A vH B)
 
Theoremshjcl 9313 Closure of CH join.
|- A e. SH   &   |- B e. SH   =>   |- (A vH B) e. CH
 
Theoremshjshcl 9314 SH closure of join.
|- A e. SH   &   |- B e. SH   =>   |- (A vH B) e. SH
 
Theoremshlub 9315 Hilbert lattice join is the least upper bound (among Hilbert lattice elements) of two subspaces.
|- A e. SH   &   |- B e. SH   &   |- C e. CH   =>   |- ((A (_ C /\ B (_ C) <-> (A vH B) (_ C)
 
Theoremshless 9316 Subset implies subset of subspace sum.
|- A e. SH   &   |- B e. SH   &   |- C e. SH   =>   |- (A (_ B -> (A +H C) (_ (B +H C))
 
Theoremshlej1 9317 Add disjunct to both sides of Hilbert subspace ordering.
|- A e. SH   &   |- B e. SH   &   |- C e. SH   =>   |- (A (_ B -> (A vH C) (_ (B vH C))
 
Theoremshlej2 9318 Add disjunct to both sides of Hilbert subspace ordering.
|- A e. SH   &   |- B e. SH   &   |- C e. SH   =>   |- (A (_ B -> (C vH A) (_ (C vH B))
 
Theoremshslejt 9319 Subspace sum is smaller than subspace join. Remark in [Kalmbach] p. 65.
|- ((A e. SH /\ B e. SH) -> (A +H B) (_ (A vH B))
 
Theoremshinclt 9320 Closure of intersection of two subspaces.
|- ((A e. SH /\ B e. SH) -> (A i^i B) e. SH)
 
Theoremshub1t 9321 Hilbert lattice join is an upper bound of two subspaces.
|- ((A e. SH /\ B e. SH) -> A (_ (A vH B))
 
Theoremshub2t 9322 A subspace is a subset of its Hilbert lattice join with another.
|- ((A e. SH /\ B e. SH) -> A (_ (B vH A))
 
Theoremshlubt 9323 Hilbert lattice join is the least upper bound (among Hilbert lattice elements) of two subspaces.
|- ((A e. SH /\ B e. SH /\ C e. CH) -> ((A (_ C /\ B (_ C) <-> (A vH B) (_ C))
 
Theoremshlej1t 9324 Add disjunct to both sides of Hilbert subspace ordering.
|- (((A e. SH /\ B e. SH /\ C e. SH) /\ A (_ B) -> (A vH C) (_ (B vH C))
 
Theoremshlej2t 9325 Add disjunct to both sides of Hilbert subspace ordering.
|- (((A e. SH /\ B e. SH /\ C e. SH) /\ A (_ B) -> (C vH A) (_ (C vH B))
 
Theoremshsidm 9326 Idempotent law for Hilbert subspace sum.
|- A e. SH   =>   |- (A +H A) = A
 
Theoremshslub 9327 Least upper bound law for Hilbert subspace sum.
|- A e. SH   &   |- B e. SH   &   |- C e. SH   =>   |- ((A (_ C /\ B (_ C) <-> (A +H B) (_ C)
 
Theoremshlesb1 9328 Hilbert lattice ordering in terms of subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- (A (_ B <-> (A +H B) = B)
 
Theoremshsumval2 9329 An alternate way to express subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- (A +H B) = |^|{x e. SH | (A u. B) (_ x}
 
Theoremshsumval3 9330 An alternate way to express subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- (A +H B) = (span` (A u. B))
 
Theoremshmods 9331 The modular law holds for subspace sum. Similar to part of Theorem 16.9 of [MaedaMaeda] p. 70.
|- A e. SH   &   |- B e. SH   &   |- C e. SH   =>   |- (A (_ C -> ((A +H B) i^i C) (_ (A +H (B i^i C)))
 
Theoremshmod 9332 The modular law is implied by the closure of subspace sum. Part of proof of Theorem 16.9 of [MaedaMaeda] p. 70.
|- A e. SH   &   |- B e. SH   &   |- C e. SH   =>   |- (((A +H B) = (A vH B) /\ A (_ C) -> ((A vH B) i^i C) (_ (A vH (B i^i C)))
 
Hilbert lattice operations
 
Theoremsh0let 9333 The zero subspace is the smallest subspace.
|- (A e. SH -> 0H (_ A)
 
Theoremch0let 9334 The zero subspace is the smallest member of CH.
|- (A e. CH -> 0H (_ A)
 
Theoremshle0t 9335 No subspace is smaller than the zero subspace.
|- (A e. SH -> (A (_ 0H <-> A = 0H))
 
Theoremchle0t 9336 No Hilbert lattice element is smaller than zero.
|- (A e. CH -> (A (_ 0H <-> A = 0H))
 
Theoremchnlen0 9337 A Hilbert lattice element that is not a subset of another is nonzero.
|- (B e. CH -> (-. A (_ B -> -. A = 0H))
 
Theoremch0psst 9338 The zero subspace is a proper subset of non-zero Hilbert lattice elements.
|- (A e. CH -> (0H (. A <-> A =/= 0H))
 
Theoremorthin 9339 The intersection of orthogonal subspaces is the zero subspace.
|- ((A e. SH /\ B e. SH) -> (A (_ (_|_` B) -> (A i^i B) = 0H))
 
Theoremshne0 9340 A non-zero subspace has a non-zero vector.
|- A e. SH   =>   |- (A =/= 0H <-> E.x e. A x =/= 0h)
 
Theoremshs0 9341 Hilbert subspace sum with the zero subspace.
|- A e. SH   =>   |- (A +H 0H) = A
 
Theoremshs00 9342 Two subspaces are zero iff their join is zero.
|- A e. SH   &   |- B e. SH   =>   |- ((A = 0H /\ B = 0H) <-> (A +H B) = 0H)
 
Theoremch0le 9343 The closed subspace zero is the smallest member of CH.
|- A e. CH   =>   |- 0H (_ A
 
Theoremchle0 9344 No Hilbert closed subspace is smaller than zero.
|- A e. CH   =>   |- (A (_ 0H <-> A = 0H)
 
Theoremchne0 9345 A non-zero closed subspace has a non-zero vector.
|- A e. CH   =>   |- (A =/= 0H <-> E.x e. A x =/= 0h)
 
Theoremchocin 9346 Intersection of a closed subspace and its orthocomplement. Part of Proposition 1 of [Kalmbach] p. 65.
|- A e. CH   =>   |- (A i^i (_|_` A)) = 0H
 
Theoremchj0 9347 Join with lattice zero in CH.
|- A e. CH   =>   |- (A vH 0H) = A
 
Theoremchm1 9348 Meet with lattice one in CH.
|- A e. CH   =>   |- (A i^i H~) = A
 
Theoremchjcl 9349 Closure of CH join.
|- A e. CH   &   |- B e. CH   =>   |- (A vH B) e. CH
 
Theoremchslej 9350 Subspace sum is smaller than subspace join. Remark in [Kalmbach] p. 65.
|- A e. CH   &   |- B e. CH   =>   |- (A +H B) (_ (A vH B)
 
Theoremchsel 9351 Membership in subspace sum.
|- A e. CH   &   |- B e. CH   =>   |- (C e. (A +H B) <-> E.x e. A E.y e. B C = (x +h y))
 
Theoremchincl 9352 Closure of Hilbert lattice intersection.
|- A e. CH   &   |- B e. CH   =>   |- (A i^i B) e. CH
 
Theoremchsscon3 9353 Hilbert lattice contraposition law.
|- A e. CH   &   |- B e. CH   =>   |- (A (_ B <-> (_|_`
 B) (_ (_|_` A))
 
Theoremchsscon1 9354 Hilbert lattice contraposition law.
|- A e. CH   &   |- B e. CH   =>   |- ((_|_` A) (_ B <-> (_|_` B) (_ A)
 
Theoremchsscon2 9355 Hilbert lattice contraposition law.
|- A e. CH   &   |- B e. CH   =>   |- (A (_ (_|_` B) <-> B (_ (_|_` A))
 
Theoremchcon2 9356 Hilbert lattice contraposition law.
|- A e. CH   &   |- B e. CH   =>   |- (A = (_|_` B) <-> B = (_|_` A))
 
Theoremchcon1 9357 Hilbert lattice contraposition law.
|- A e. CH   &   |- B e. CH   =>   |- ((_|_` A) = B <-> (_|_`
 B) = A)
 
Theoremchcon3 9358 Hilbert lattice contraposition law.
|- A e. CH   &   |- B e. CH   =>   |- (A = B <-> (_|_`
 B) = (_|_` A))
 
Theoremchunssj 9359 Union is smaller than CH join.
|- A e. CH   &   |- B e. CH   =>   |- (A u. B) (_ (A vH B)
 
Theoremchjcom 9360 Commutative law for join in CH.
|- A e. CH   &   |- B e. CH   =>   |- (A vH B) = (B vH A)
 
Theoremchub1 9361 CH join is an upper bound of two elements.
|- A e. CH   &   |- B e. CH   =>   |- A (_ (A vH B)
 
Theoremchub2 9362 CH join is an upper bound of two elements.
|- A e. CH   &   |- B