| 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 32572 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 39680 | . 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 3117 | . . . 4 ⊢ (∀𝑠 ∈ 𝑆 ((𝑇 ⊊ 𝑠 ∧ 𝑠 ⊆ 𝑈) → 𝑠 = 𝑈) ↔ ∀𝑠 ∈ 𝑆 ¬ (𝑇 ⊊ 𝑠 ∧ 𝑠 ⊊ 𝑈)) |
| 14 | ralnex 3097 | . . . 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 1567 ∈ wcel 2149 ∀wral 3085 ∃wrex 3095 ⊆ wss 3913 ⊊ wpss 3914 class class class wbr 5110 ‘cfv 6533 LSubSpclss 21026 ⋖L clcv 39677 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6489 df-fun 6535 df-fv 6541 df-lcv 39678 |
| This theorem is referenced by: lsmcv2 39688 lsat0cv 39692 |
| Copyright terms: Public domain | W3C validator |