| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lcvbr2 | Structured version Visualization version GIF version | ||
| Description: The covers relation for a left vector space (or a left module). (cvbr2 32369 analog.) (Contributed by NM, 9-Jan-2015.) |
| Ref | Expression |
|---|---|
| lcvfbr.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
| lcvfbr.c | ⊢ 𝐶 = ( ⋖L ‘𝑊) |
| lcvfbr.w | ⊢ (𝜑 → 𝑊 ∈ 𝑋) |
| lcvfbr.t | ⊢ (𝜑 → 𝑇 ∈ 𝑆) |
| lcvfbr.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| lcvbr2 | ⊢ (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇 ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lcvfbr.s | . . 3 ⊢ 𝑆 = (LSubSp‘𝑊) | |
| 2 | lcvfbr.c | . . 3 ⊢ 𝐶 = ( ⋖L ‘𝑊) | |
| 3 | lcvfbr.w | . . 3 ⊢ (𝜑 → 𝑊 ∈ 𝑋) | |
| 4 | lcvfbr.t | . . 3 ⊢ (𝜑 → 𝑇 ∈ 𝑆) | |
| 5 | lcvfbr.u | . . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
| 6 | 1, 2, 3, 4, 5 | lcvbr 39481 | . 2 ⊢ (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇 ⊊ 𝑈 ∧ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)))) |
| 7 | iman 401 | . . . . . 6 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ¬ ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) ∧ ¬ 𝑠 = 𝑈)) | |
| 8 | anass 468 | . . . . . . 7 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) ∧ ¬ 𝑠 = 𝑈) ↔ (𝑇 ⊊ 𝑠 ∧ (𝑠 ⊆ 𝑈 ∧ ¬ 𝑠 = 𝑈))) | |
| 9 | dfpss2 4029 | . . . . . . . 8 ⊢ (𝑠 ⊊ 𝑈 ↔ (𝑠 ⊆ 𝑈 ∧ ¬ 𝑠 = 𝑈)) | |
| 10 | 9 | anbi2i 624 | . . . . . . 7 ⊢ ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈) ↔ (𝑇 ⊊ 𝑠 ∧ (𝑠 ⊆ 𝑈 ∧ ¬ 𝑠 = 𝑈))) |
| 11 | 8, 10 | bitr4i 278 | . . . . . 6 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) ∧ ¬ 𝑠 = 𝑈) ↔ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 12 | 7, 11 | xchbinx 334 | . . . . 5 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 13 | 12 | ralbii 3084 | . . . 4 ⊢ (∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ∀𝑠 ∈ 𝑆 ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 14 | ralnex 3064 | . . . 4 ⊢ (∀𝑠 ∈ 𝑆 ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈) ↔ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) | |
| 15 | 13, 14 | bitri 275 | . . 3 ⊢ (∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 16 | 15 | anbi2i 624 | . 2 ⊢ ((𝑇 ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈)) ↔ (𝑇 ⊊ 𝑈 ∧ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈))) |
| 17 | 6, 16 | bitr4di 289 | 1 ⊢ (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇 ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 ⊆ wss 3890 ⊊ wpss 3891 class class class wbr 5086 ‘cfv 6492 LSubSpclss 20917 ⋖L clcv 39478 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-iota 6448 df-fun 6494 df-fv 6500 df-lcv 39479 |
| This theorem is referenced by: lsmcv2 39489 lsat0cv 39493 |
| Copyright terms: Public domain | W3C validator |