Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > thlle | Structured version Visualization version GIF version |
Description: Ordering on the Hilbert lattice of closed subspaces. (Contributed by Mario Carneiro, 25-Oct-2015.) |
Ref | Expression |
---|---|
thlval.k | ⊢ 𝐾 = (toHL‘𝑊) |
thlbas.c | ⊢ 𝐶 = (ClSubSp‘𝑊) |
thlle.i | ⊢ 𝐼 = (toInc‘𝐶) |
thlle.l | ⊢ ≤ = (le‘𝐼) |
Ref | Expression |
---|---|
thlle | ⊢ ≤ = (le‘𝐾) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | thlval.k | . . . . 5 ⊢ 𝐾 = (toHL‘𝑊) | |
2 | thlbas.c | . . . . 5 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
3 | thlle.i | . . . . 5 ⊢ 𝐼 = (toInc‘𝐶) | |
4 | eqid 2821 | . . . . 5 ⊢ (ocv‘𝑊) = (ocv‘𝑊) | |
5 | 1, 2, 3, 4 | thlval 20822 | . . . 4 ⊢ (𝑊 ∈ V → 𝐾 = (𝐼 sSet 〈(oc‘ndx), (ocv‘𝑊)〉)) |
6 | 5 | fveq2d 6660 | . . 3 ⊢ (𝑊 ∈ V → (le‘𝐾) = (le‘(𝐼 sSet 〈(oc‘ndx), (ocv‘𝑊)〉))) |
7 | thlle.l | . . . 4 ⊢ ≤ = (le‘𝐼) | |
8 | pleid 16650 | . . . . 5 ⊢ le = Slot (le‘ndx) | |
9 | 10re 12104 | . . . . . . 7 ⊢ ;10 ∈ ℝ | |
10 | 1nn0 11900 | . . . . . . . 8 ⊢ 1 ∈ ℕ0 | |
11 | 0nn0 11899 | . . . . . . . 8 ⊢ 0 ∈ ℕ0 | |
12 | 1nn 11635 | . . . . . . . 8 ⊢ 1 ∈ ℕ | |
13 | 0lt1 11148 | . . . . . . . 8 ⊢ 0 < 1 | |
14 | 10, 11, 12, 13 | declt 12113 | . . . . . . 7 ⊢ ;10 < ;11 |
15 | 9, 14 | ltneii 10739 | . . . . . 6 ⊢ ;10 ≠ ;11 |
16 | plendx 16649 | . . . . . . 7 ⊢ (le‘ndx) = ;10 | |
17 | ocndx 16656 | . . . . . . 7 ⊢ (oc‘ndx) = ;11 | |
18 | 16, 17 | neeq12i 3082 | . . . . . 6 ⊢ ((le‘ndx) ≠ (oc‘ndx) ↔ ;10 ≠ ;11) |
19 | 15, 18 | mpbir 233 | . . . . 5 ⊢ (le‘ndx) ≠ (oc‘ndx) |
20 | 8, 19 | setsnid 16522 | . . . 4 ⊢ (le‘𝐼) = (le‘(𝐼 sSet 〈(oc‘ndx), (ocv‘𝑊)〉)) |
21 | 7, 20 | eqtri 2844 | . . 3 ⊢ ≤ = (le‘(𝐼 sSet 〈(oc‘ndx), (ocv‘𝑊)〉)) |
22 | 6, 21 | syl6reqr 2875 | . 2 ⊢ (𝑊 ∈ V → ≤ = (le‘𝐾)) |
23 | 8 | str0 16518 | . . 3 ⊢ ∅ = (le‘∅) |
24 | 2 | fvexi 6670 | . . . . . 6 ⊢ 𝐶 ∈ V |
25 | 3 | ipolerval 17749 | . . . . . 6 ⊢ (𝐶 ∈ V → {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)} = (le‘𝐼)) |
26 | 24, 25 | ax-mp 5 | . . . . 5 ⊢ {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)} = (le‘𝐼) |
27 | 7, 26 | eqtr4i 2847 | . . . 4 ⊢ ≤ = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)} |
28 | opabn0 5426 | . . . . . 6 ⊢ ({〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)} ≠ ∅ ↔ ∃𝑥∃𝑦({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)) | |
29 | vex 3489 | . . . . . . . . 9 ⊢ 𝑥 ∈ V | |
30 | vex 3489 | . . . . . . . . 9 ⊢ 𝑦 ∈ V | |
31 | 29, 30 | prss 4739 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) ↔ {𝑥, 𝑦} ⊆ 𝐶) |
32 | elfvex 6689 | . . . . . . . . . 10 ⊢ (𝑥 ∈ (ClSubSp‘𝑊) → 𝑊 ∈ V) | |
33 | 32, 2 | eleq2s 2931 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐶 → 𝑊 ∈ V) |
34 | 33 | ad2antrr 724 | . . . . . . . 8 ⊢ (((𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ⊆ 𝑦) → 𝑊 ∈ V) |
35 | 31, 34 | sylanbr 584 | . . . . . . 7 ⊢ (({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦) → 𝑊 ∈ V) |
36 | 35 | exlimivv 1933 | . . . . . 6 ⊢ (∃𝑥∃𝑦({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦) → 𝑊 ∈ V) |
37 | 28, 36 | sylbi 219 | . . . . 5 ⊢ ({〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)} ≠ ∅ → 𝑊 ∈ V) |
38 | 37 | necon1bi 3044 | . . . 4 ⊢ (¬ 𝑊 ∈ V → {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝐶 ∧ 𝑥 ⊆ 𝑦)} = ∅) |
39 | 27, 38 | syl5eq 2868 | . . 3 ⊢ (¬ 𝑊 ∈ V → ≤ = ∅) |
40 | fvprc 6649 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (toHL‘𝑊) = ∅) | |
41 | 1, 40 | syl5eq 2868 | . . . 4 ⊢ (¬ 𝑊 ∈ V → 𝐾 = ∅) |
42 | 41 | fveq2d 6660 | . . 3 ⊢ (¬ 𝑊 ∈ V → (le‘𝐾) = (le‘∅)) |
43 | 23, 39, 42 | 3eqtr4a 2882 | . 2 ⊢ (¬ 𝑊 ∈ V → ≤ = (le‘𝐾)) |
44 | 22, 43 | pm2.61i 184 | 1 ⊢ ≤ = (le‘𝐾) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 398 = wceq 1537 ∃wex 1780 ∈ wcel 2114 ≠ wne 3016 Vcvv 3486 ⊆ wss 3924 ∅c0 4279 {cpr 4555 〈cop 4559 {copab 5114 ‘cfv 6341 (class class class)co 7142 0cc0 10523 1c1 10524 ;cdc 12085 ndxcnx 16463 sSet csts 16464 lecple 16555 occoc 16556 toInccipo 17744 ocvcocv 20787 ClSubSpccss 20788 toHLcthl 20789 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5189 ax-nul 5196 ax-pow 5252 ax-pr 5316 ax-un 7447 ax-cnex 10579 ax-resscn 10580 ax-1cn 10581 ax-icn 10582 ax-addcl 10583 ax-addrcl 10584 ax-mulcl 10585 ax-mulrcl 10586 ax-mulcom 10587 ax-addass 10588 ax-mulass 10589 ax-distr 10590 ax-i2m1 10591 ax-1ne0 10592 ax-1rid 10593 ax-rnegex 10594 ax-rrecex 10595 ax-cnre 10596 ax-pre-lttri 10597 ax-pre-lttrn 10598 ax-pre-ltadd 10599 ax-pre-mulgt0 10600 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3488 df-sbc 3764 df-csb 3872 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-pss 3942 df-nul 4280 df-if 4454 df-pw 4527 df-sn 4554 df-pr 4556 df-tp 4558 df-op 4560 df-uni 4825 df-int 4863 df-iun 4907 df-br 5053 df-opab 5115 df-mpt 5133 df-tr 5159 df-id 5446 df-eprel 5451 df-po 5460 df-so 5461 df-fr 5500 df-we 5502 df-xp 5547 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-res 5553 df-ima 5554 df-pred 6134 df-ord 6180 df-on 6181 df-lim 6182 df-suc 6183 df-iota 6300 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 df-fo 6347 df-f1o 6348 df-fv 6349 df-riota 7100 df-ov 7145 df-oprab 7146 df-mpo 7147 df-om 7567 df-1st 7675 df-2nd 7676 df-wrecs 7933 df-recs 7994 df-rdg 8032 df-1o 8088 df-oadd 8092 df-er 8275 df-en 8496 df-dom 8497 df-sdom 8498 df-fin 8499 df-pnf 10663 df-mnf 10664 df-xr 10665 df-ltxr 10666 df-le 10667 df-sub 10858 df-neg 10859 df-nn 11625 df-2 11687 df-3 11688 df-4 11689 df-5 11690 df-6 11691 df-7 11692 df-8 11693 df-9 11694 df-n0 11885 df-z 11969 df-dec 12086 df-uz 12231 df-fz 12883 df-struct 16468 df-ndx 16469 df-slot 16470 df-base 16472 df-sets 16473 df-tset 16567 df-ple 16568 df-ocomp 16569 df-ipo 17745 df-thl 20792 |
This theorem is referenced by: thlleval 20825 |
Copyright terms: Public domain | W3C validator |