| 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 32605 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 39745 | . 2 ⊢ (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇 ⊊ 𝑈 ∧ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)))) |
| 7 | iman 406 | . . . . . 6 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ¬ ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) ∧ ¬ 𝑠 = 𝑈)) | |
| 8 | anass 473 | . . . . . . 7 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) ∧ ¬ 𝑠 = 𝑈) ↔ (𝑇 ⊊ 𝑠 ∧ (𝑠 ⊆ 𝑈 ∧ ¬ 𝑠 = 𝑈))) | |
| 9 | dfpss2 4050 | . . . . . . . 8 ⊢ (𝑠 ⊊ 𝑈 ↔ (𝑠 ⊆ 𝑈 ∧ ¬ 𝑠 = 𝑈)) | |
| 10 | 9 | anbi2i 634 | . . . . . . 7 ⊢ ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈) ↔ (𝑇 ⊊ 𝑠 ∧ (𝑠 ⊆ 𝑈 ∧ ¬ 𝑠 = 𝑈))) |
| 11 | 8, 10 | bitr4i 281 | . . . . . 6 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) ∧ ¬ 𝑠 = 𝑈) ↔ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 12 | 7, 11 | xchbinx 337 | . . . . 5 ⊢ (((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 13 | 12 | ralbii 3118 | . . . 4 ⊢ (∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ∀𝑠 ∈ 𝑆 ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 14 | ralnex 3098 | . . . 4 ⊢ (∀𝑠 ∈ 𝑆 ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈) ↔ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) | |
| 15 | 13, 14 | bitri 278 | . . 3 ⊢ (∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 16 | 15 | anbi2i 634 | . 2 ⊢ ((𝑇 ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈)) ↔ (𝑇 ⊊ 𝑈 ∧ ¬ ∃𝑠 ∈ 𝑆 (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈))) |
| 17 | 6, 16 | bitr4di 292 | 1 ⊢ (𝜑 → (𝑇𝐶𝑈 ↔ (𝑇 ⊊ 𝑈 ∧ ∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2150 ∀wral 3086 ∃wrex 3096 ⊆ wss 3913 ⊊ wpss 3914 class class class wbr 5114 ‘cfv 6540 LSubSpclss 21035 ⋖L clcv 39742 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pow 5340 ax-pr 5408 ax-un 7736 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-nfc 2919 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5560 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-iota 6496 df-fun 6542 df-fv 6548 df-lcv 39743 |
| This theorem is referenced by: lsmcv2 39753 lsat0cv 39757 |
| Copyright terms: Public domain | W3C validator |