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

Jump to page: 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-5787

Color key:    Metamath Proof
Explorer  Metamath Proof Explorer (1-4957)   Hilbert Space Explorer  Hilbert Space Explorer (4958-5787)  

Statement List for Metamath Proof Explorer - 5401-5500 - Page 55 of 58
TypeLabelDescription
Statement
 
Theoremchdmm4 5401 DeMorgan's law for meet in a Hilbert lattice.
|- A e. CH   &   |- B e. CH   =>   |- (_|_` ((_|_`
 A) i^i (_|_` B))) = (A vH B)
 
Theoremchdmj1 5402 DeMorgan's law for join in a Hilbert lattice.
|- A e. CH   &   |- B e. CH   =>   |- (_|_` (A vH B)) = ((_|_` A) i^i (_|_` B))
 
Theoremchdmj2 5403 DeMorgan's law for join in a Hilbert lattice.
|- A e. CH   &   |- B e. CH   =>   |- (_|_` ((_|_`
 A) vH B)) = (A i^i (_|_` B))
 
Theoremchdmj3 5404 DeMorgan's law for join in a Hilbert lattice.
|- A e. CH   &   |- B e. CH   =>   |- (_|_` (A vH (_|_` B))) = ((_|_` A) i^i B)
 
Theoremchdmj4 5405 DeMorgan's law for join in a Hilbert lattice.
|- A e. CH   &   |- B e. CH   =>   |- (_|_` ((_|_`
 A) vH (_|_` B))) = (A i^i B)
 
Theoremchnle 5406 Equivalent expressions for "not less than" in the Hilbert lattice.
|- A e. CH   &   |- B e. CH   =>   |- (-. B (_ A <-> A (. (A vH B))
 
Theoremchjass 5407 Associative law for Hilbert lattice join. From definition of lattice in [Kalmbach] p. 14.
|- A e. CH   &   |- B e. CH   &   |- C e. CH   =>   |- ((A vH B) vH C) = (A vH (B vH C))
 
Theoremchj00 5408 Two Hilbert lattice elements are zero iff their join is zero.
|- A e. CH   &   |- B e. CH   =>   |- ((A = 0H /\ B = 0H) <-> (A vH B) = 0H)
 
Theoremchjo 5409 The join of a closed subspace and its orthocomplement.
|- A e. CH   =>   |- (A vH (_|_` A)) = H~
 
Theoremchj1 5410 Join with Hilbert lattice unit.
|- A e. CH   =>   |- (A vH H~) = H~
 
Theoremchm0 5411 Meet with Hilbert lattice zero.
|- A e. CH   =>   |- (A i^i 0H) = 0H
 
Theoremshjshs 5412 Hilbert lattice join equals the double orthocomplement of subspace sum.
|- A e. SH   &   |- B e. SH   =>   |- (A vH B) = (_|_` (_|_` (A +H B)))
 
Theoremshjshsel 5413 A closed subspace sum equals Hilbert lattice join. Part of Lemma 31.1.5 of [MaedaMaeda] p. 136.
|- A e. SH   &   |- B e. SH   =>   |- ((A +H B) e. CH <-> (A +H B) = (A vH B))
 
Theoremchj0t 5414 Join with Hilbert lattice zero.
|- (A e. CH -> (A vH 0H) = A)
 
Theoremchslejt 5415 Subspace sum is smaller than subspace join. Remark of [Kalmbach] p. 65.
|- ((A e. CH /\ B e. CH) -> (A +H B) (_ (A vH B))
 
Theoremchinclt 5416 Closure of Hilbert lattice intersection.
|- ((A e. CH /\ B e. CH) -> (A i^i B) e. CH)
 
Theoremchsscon3t 5417 Hilbert lattice contraposition law.
|- ((A e. CH /\ B e. CH) -> (A (_ B <-> (_|_` B) (_ (_|_` A)))
 
Theoremchsscon1t 5418 Hilbert lattice contraposition law.
|- ((A e. CH /\ B e. CH) -> ((_|_` A) (_ B <-> (_|_` B) (_ A))
 
Theoremchsscon2t 5419 Hilbert lattice contraposition law.
|- ((A e. CH /\ B e. CH) -> (A (_ (_|_` B) <-> B (_ (_|_`
 A)))
 
Theoremchpsscon3t 5420 Hilbert lattice contraposition law for strict ordering.
|- ((A e. CH /\ B e. CH) -> (A (. B <-> (_|_` B) (. (_|_` A)))
 
Theoremchpsscon1t 5421 Hilbert lattice contraposition law for strict ordering.
|- ((A e. CH /\ B e. CH) -> ((_|_` A) (. B <-> (_|_` B) (. A))
 
Theoremchpsscon2t 5422 Hilbert lattice contraposition law for strict ordering.
|- ((A e. CH /\ B e. CH) -> (A (. (_|_` B) <-> B (. (_|_` A)))
 
Theoremchjcomt 5423 Commutative law for Hilbert lattice join.
|- ((A e. CH /\ B e. CH) -> (A vH B) = (B vH A))
 
Theoremchub1t 5424 Hilbert lattice join is greater than or equal to its first argument.
|- ((A e. CH /\ B e. CH) -> A (_ (A vH B))
 
Theoremchub2t 5425 Hilbert lattice join is greater than or equal to its second argument.
|- ((A e. CH /\ B e. CH) -> A (_ (B vH A))
 
Theoremchlubt 5426 Hilbert lattice join is the least upper bound of two elements.
|- ((A e. CH /\ B e. CH /\ C e. CH) -> ((A (_ C /\ B (_ C) <-> (A vH B) (_ C))
 
Theoremchlej1t 5427 Add join to both sides of Hilbert lattice ordering.
|- ((A e. CH /\ B e. CH /\ C e. CH) -> (A (_ B -> (A vH C) (_ (B vH C)))
 
Theoremchlej2t 5428 Add join to both sides of Hilbert lattice ordering.
|- ((A e. CH /\ B e. CH /\ C e. CH) -> (A (_ B -> (C vH A) (_ (C vH B)))
 
Theoremchlejb1t 5429 Hilbert lattice ordering in terms of join.
|- ((A e. CH /\ B e. CH) -> (A (_ B <-> (A vH B) = B))
 
Theoremchlejb2t 5430 Hilbert lattice ordering in terms of join.
|- ((A e. CH /\ B e. CH) -> (A (_ B <-> (B vH A) = B))
 
Theoremchnlet 5431 Equivalent expressions for "not less than" in the Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (-. B (_ A <-> A (. (A vH B)))
 
Theoremchabs1t 5432 Hilbert lattice absorption law. From definition of lattice in [Kalmbach] p. 14.
|- ((A e. CH /\ B e. CH) -> (A vH (A i^i B)) = A)
 
Theoremchabs2t 5433 Hilbert lattice absorption law. From definition of lattice in [Kalmbach] p. 14.
|- ((A e. CH /\ B e. CH) -> (A i^i (A vH B)) = A)
 
Theoremchabs1 5434 Hilbert lattice absorption law. From definition of lattice in [Kalmbach] p. 14.
|- A e. CH   &   |- B e. CH   =>   |- (A vH (A i^i B)) = A
 
Theoremchabs2 5435 Hilbert lattice absorption law. From definition of lattice in [Kalmbach] p. 14.
|- A e. CH   &   |- B e. CH   =>   |- (A i^i (A vH B)) = A
 
Theoremchjidmt 5436 Idempotent law for Hilbert lattice join.
|- (A e. CH -> (A vH A) = A)
 
Theoremchjidm 5437 Idempotent law for Hilbert lattice join.
|- A e. CH   =>   |- (A vH A) = A
 
Theoremchdmm1t 5438 DeMorgan's law for meet in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` (A i^i B)) = ((_|_` A) vH (_|_` B)))
 
Theoremchdmm2t 5439 DeMorgan's law for meet in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` ((_|_` A) i^i B)) = (A vH (_|_`
 B)))
 
Theoremchdmm3t 5440 DeMorgan's law for meet in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` (A i^i (_|_` B))) = ((_|_` A) vH B))
 
Theoremchdmm4t 5441 DeMorgan's law for meet in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` ((_|_` A) i^i (_|_` B))) = (A vH B))
 
Theoremchdmj1t 5442 DeMorgan's law for join in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` (A vH B)) = ((_|_` A) i^i (_|_` B)))
 
Theoremchdmj2t 5443 DeMorgan's law for join in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` ((_|_` A) vH B)) = (A i^i (_|_`
 B)))
 
Theoremchdmj3t 5444 DeMorgan's law for join in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` (A vH (_|_` B))) = ((_|_` A) i^i B))
 
Theoremchdmj4t 5445 DeMorgan's law for join in a Hilbert lattice.
|- ((A e. CH /\ B e. CH) -> (_|_` ((_|_` A) vH (_|_` B))) = (A i^i B))
 
Theoremchjasst 5446 Associative law for Hilbert lattice join. From definition of lattice in [Kalmbach] p. 14.
|- ((A e. CH /\ B e. CH /\ C e. CH) -> ((A vH B) vH C) = (A vH (B vH C)))
 
Theoremledi 5447 An ortholattice is distributive in one ordering direction.
|- A e. CH   &   |- B e. CH   &   |- C e. CH   =>   |- ((A i^i B) vH (A i^i C)) (_ (A i^i (B vH C))
 
Theoremspan0 5448 The span of the empty set is the zero subspace. Remark 11.6.e of [Schechter] p. 276.
|- (span` (/)) = 0H
 
Theoremelspan 5449 Membership in the span of a subset of Hilbert space.
|- B e. V   =>   |- (A (_ H~ -> (B e. (span` A) <-> A.x e. SH (A (_ x -> B e. x)))
 
Theoremspanun 5450 The span of a union is the subspace sum of spans.
|- A (_ H~   &   |- B (_ H~   =>   |- (span` (A u. B)) = ((span` A) +H (span` B))
 
Theoremsshhococ 5451 The join of two Hilbert space subsets (not necessarily closed subspaces) equals the join of their closures (double orthocomplements).
|- A (_ H~   &   |- B (_ H~   =>   |- (A vH B) = ((_|_`
 (_|_` A)) vH (_|_` (_|_`
 B)))
 
Theoremchne0t 5452 A non-zero closed subspace has a non-zero vector.
|- (A e. CH -> (-. A = 0H <-> E.x e. A -. x = 0v))
 
Theoremchsup0 5453 The supremum of the empty set.
|- ( \/H ` (/)) = 0H
 
Theoremh1deot 5454 Membership in orthocomplement of 1-dimensional subspace.
|- B e. H~   =>   |- (A e. (_|_` {B}) <-> (A e. H~ /\ (A .i B) = 0))
 
Theoremh1det 5455 Membership in 1-dimensional subspace.
|- B e. H~   =>   |- (A e. (_|_` (_|_`
 {B})) <-> (A e. H~ /\ A.x e. H~ ((B .i x) = 0 -> (A .i x) = 0)))
 
Theoremh1did 5456 A generating vector belongs to the 1-dimensional subspace it generates.
|- (A e. H~ -> A e. (_|_` (_|_` {A})))
 
Theoremh1dn0 5457 A non-zero vector generates a (non-zero) 1-dimensional subspace.
|- ((A e. H~ /\ -. A = 0v) -> -. (_|_` (_|_`
 {A})) = 0H)
 
Theoremh1de2 5458 Membership in 1-dimensional subspace. All members are collinear with the generating vector.
|- A e. H~   &   |- B e. H~   =>   |- (A e. (_|_` (_|_` {B})) -> ((B .i B) .s A) = ((A .i B)