Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mrelatglb | Structured version Visualization version GIF version |
Description: Greatest lower bounds in a Moore space are realized by intersections. (Contributed by Stefan O'Rear, 31-Jan-2015.) |
Ref | Expression |
---|---|
mreclat.i | ⊢ 𝐼 = (toInc‘𝐶) |
mrelatglb.g | ⊢ 𝐺 = (glb‘𝐼) |
Ref | Expression |
---|---|
mrelatglb | ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → (𝐺‘𝑈) = ∩ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2622 | . 2 ⊢ (le‘𝐼) = (le‘𝐼) | |
2 | mreclat.i | . . . 4 ⊢ 𝐼 = (toInc‘𝐶) | |
3 | 2 | ipobas 17155 | . . 3 ⊢ (𝐶 ∈ (Moore‘𝑋) → 𝐶 = (Base‘𝐼)) |
4 | 3 | 3ad2ant1 1082 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → 𝐶 = (Base‘𝐼)) |
5 | mrelatglb.g | . . 3 ⊢ 𝐺 = (glb‘𝐼) | |
6 | 5 | a1i 11 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → 𝐺 = (glb‘𝐼)) |
7 | 2 | ipopos 17160 | . . 3 ⊢ 𝐼 ∈ Poset |
8 | 7 | a1i 11 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → 𝐼 ∈ Poset) |
9 | simp2 1062 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → 𝑈 ⊆ 𝐶) | |
10 | mreintcl 16255 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → ∩ 𝑈 ∈ 𝐶) | |
11 | intss1 4492 | . . . 4 ⊢ (𝑥 ∈ 𝑈 → ∩ 𝑈 ⊆ 𝑥) | |
12 | 11 | adantl 482 | . . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑥 ∈ 𝑈) → ∩ 𝑈 ⊆ 𝑥) |
13 | simpl1 1064 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑥 ∈ 𝑈) → 𝐶 ∈ (Moore‘𝑋)) | |
14 | 10 | adantr 481 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑥 ∈ 𝑈) → ∩ 𝑈 ∈ 𝐶) |
15 | 9 | sselda 3603 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ 𝐶) |
16 | 2, 1 | ipole 17158 | . . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ ∩ 𝑈 ∈ 𝐶 ∧ 𝑥 ∈ 𝐶) → (∩ 𝑈(le‘𝐼)𝑥 ↔ ∩ 𝑈 ⊆ 𝑥)) |
17 | 13, 14, 15, 16 | syl3anc 1326 | . . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑥 ∈ 𝑈) → (∩ 𝑈(le‘𝐼)𝑥 ↔ ∩ 𝑈 ⊆ 𝑥)) |
18 | 12, 17 | mpbird 247 | . 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑥 ∈ 𝑈) → ∩ 𝑈(le‘𝐼)𝑥) |
19 | simpll1 1100 | . . . . . . . 8 ⊢ ((((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ∈ 𝑈) → 𝐶 ∈ (Moore‘𝑋)) | |
20 | simplr 792 | . . . . . . . 8 ⊢ ((((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ∈ 𝑈) → 𝑦 ∈ 𝐶) | |
21 | simpl2 1065 | . . . . . . . . 9 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) → 𝑈 ⊆ 𝐶) | |
22 | 21 | sselda 3603 | . . . . . . . 8 ⊢ ((((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ∈ 𝑈) → 𝑥 ∈ 𝐶) |
23 | 2, 1 | ipole 17158 | . . . . . . . 8 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑦 ∈ 𝐶 ∧ 𝑥 ∈ 𝐶) → (𝑦(le‘𝐼)𝑥 ↔ 𝑦 ⊆ 𝑥)) |
24 | 19, 20, 22, 23 | syl3anc 1326 | . . . . . . 7 ⊢ ((((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ∈ 𝑈) → (𝑦(le‘𝐼)𝑥 ↔ 𝑦 ⊆ 𝑥)) |
25 | 24 | biimpd 219 | . . . . . 6 ⊢ ((((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) ∧ 𝑥 ∈ 𝑈) → (𝑦(le‘𝐼)𝑥 → 𝑦 ⊆ 𝑥)) |
26 | 25 | ralimdva 2962 | . . . . 5 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶) → (∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥 → ∀𝑥 ∈ 𝑈 𝑦 ⊆ 𝑥)) |
27 | 26 | 3impia 1261 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → ∀𝑥 ∈ 𝑈 𝑦 ⊆ 𝑥) |
28 | ssint 4493 | . . . 4 ⊢ (𝑦 ⊆ ∩ 𝑈 ↔ ∀𝑥 ∈ 𝑈 𝑦 ⊆ 𝑥) | |
29 | 27, 28 | sylibr 224 | . . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → 𝑦 ⊆ ∩ 𝑈) |
30 | simp11 1091 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → 𝐶 ∈ (Moore‘𝑋)) | |
31 | simp2 1062 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → 𝑦 ∈ 𝐶) | |
32 | 10 | 3ad2ant1 1082 | . . . 4 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → ∩ 𝑈 ∈ 𝐶) |
33 | 2, 1 | ipole 17158 | . . . 4 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑦 ∈ 𝐶 ∧ ∩ 𝑈 ∈ 𝐶) → (𝑦(le‘𝐼)∩ 𝑈 ↔ 𝑦 ⊆ ∩ 𝑈)) |
34 | 30, 31, 32, 33 | syl3anc 1326 | . . 3 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → (𝑦(le‘𝐼)∩ 𝑈 ↔ 𝑦 ⊆ ∩ 𝑈)) |
35 | 29, 34 | mpbird 247 | . 2 ⊢ (((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) ∧ 𝑦 ∈ 𝐶 ∧ ∀𝑥 ∈ 𝑈 𝑦(le‘𝐼)𝑥) → 𝑦(le‘𝐼)∩ 𝑈) |
36 | 1, 4, 6, 8, 9, 10, 18, 35 | posglbd 17150 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝑈 ⊆ 𝐶 ∧ 𝑈 ≠ ∅) → (𝐺‘𝑈) = ∩ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 ⊆ wss 3574 ∅c0 3915 ∩ cint 4475 class class class wbr 4653 ‘cfv 5888 Basecbs 15857 lecple 15948 Moorecmre 16242 Posetcpo 16940 glbcglb 16943 toInccipo 17151 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-fz 12327 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-tset 15960 df-ple 15961 df-ocomp 15963 df-mre 16246 df-preset 16928 df-poset 16946 df-lub 16974 df-glb 16975 df-odu 17129 df-ipo 17152 |
This theorem is referenced by: mreclatBAD 17187 |
Copyright terms: Public domain | W3C validator |