Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lcvnbtwn3 | Structured version Visualization version GIF version |
Description: The covers relation implies no in-betweenness. (cvnbtwn3 29147 analog.) (Contributed by NM, 7-Jan-2015.) |
Ref | Expression |
---|---|
lcvnbtwn.s | ⊢ 𝑆 = (LSubSp‘𝑊) |
lcvnbtwn.c | ⊢ 𝐶 = ( ⋖L ‘𝑊) |
lcvnbtwn.w | ⊢ (𝜑 → 𝑊 ∈ 𝑋) |
lcvnbtwn.r | ⊢ (𝜑 → 𝑅 ∈ 𝑆) |
lcvnbtwn.t | ⊢ (𝜑 → 𝑇 ∈ 𝑆) |
lcvnbtwn.u | ⊢ (𝜑 → 𝑈 ∈ 𝑆) |
lcvnbtwn.d | ⊢ (𝜑 → 𝑅𝐶𝑇) |
lcvnbtwn3.p | ⊢ (𝜑 → 𝑅 ⊆ 𝑈) |
lcvnbtwn3.q | ⊢ (𝜑 → 𝑈 ⊊ 𝑇) |
Ref | Expression |
---|---|
lcvnbtwn3 | ⊢ (𝜑 → 𝑈 = 𝑅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lcvnbtwn3.p | . 2 ⊢ (𝜑 → 𝑅 ⊆ 𝑈) | |
2 | lcvnbtwn3.q | . 2 ⊢ (𝜑 → 𝑈 ⊊ 𝑇) | |
3 | lcvnbtwn.s | . . . 4 ⊢ 𝑆 = (LSubSp‘𝑊) | |
4 | lcvnbtwn.c | . . . 4 ⊢ 𝐶 = ( ⋖L ‘𝑊) | |
5 | lcvnbtwn.w | . . . 4 ⊢ (𝜑 → 𝑊 ∈ 𝑋) | |
6 | lcvnbtwn.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑆) | |
7 | lcvnbtwn.t | . . . 4 ⊢ (𝜑 → 𝑇 ∈ 𝑆) | |
8 | lcvnbtwn.u | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑆) | |
9 | lcvnbtwn.d | . . . 4 ⊢ (𝜑 → 𝑅𝐶𝑇) | |
10 | 3, 4, 5, 6, 7, 8, 9 | lcvnbtwn 34312 | . . 3 ⊢ (𝜑 → ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)) |
11 | iman 440 | . . . 4 ⊢ (((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) → 𝑅 = 𝑈) ↔ ¬ ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) ∧ ¬ 𝑅 = 𝑈)) | |
12 | eqcom 2629 | . . . . 5 ⊢ (𝑈 = 𝑅 ↔ 𝑅 = 𝑈) | |
13 | 12 | imbi2i 326 | . . . 4 ⊢ (((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) → 𝑈 = 𝑅) ↔ ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) → 𝑅 = 𝑈)) |
14 | dfpss2 3692 | . . . . . . 7 ⊢ (𝑅 ⊊ 𝑈 ↔ (𝑅 ⊆ 𝑈 ∧ ¬ 𝑅 = 𝑈)) | |
15 | 14 | anbi1i 731 | . . . . . 6 ⊢ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ ((𝑅 ⊆ 𝑈 ∧ ¬ 𝑅 = 𝑈) ∧ 𝑈 ⊊ 𝑇)) |
16 | an32 839 | . . . . . 6 ⊢ (((𝑅 ⊆ 𝑈 ∧ ¬ 𝑅 = 𝑈) ∧ 𝑈 ⊊ 𝑇) ↔ ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) ∧ ¬ 𝑅 = 𝑈)) | |
17 | 15, 16 | bitri 264 | . . . . 5 ⊢ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) ∧ ¬ 𝑅 = 𝑈)) |
18 | 17 | notbii 310 | . . . 4 ⊢ (¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ ¬ ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) ∧ ¬ 𝑅 = 𝑈)) |
19 | 11, 13, 18 | 3bitr4ri 293 | . . 3 ⊢ (¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) → 𝑈 = 𝑅)) |
20 | 10, 19 | sylib 208 | . 2 ⊢ (𝜑 → ((𝑅 ⊆ 𝑈 ∧ 𝑈 ⊊ 𝑇) → 𝑈 = 𝑅)) |
21 | 1, 2, 20 | mp2and 715 | 1 ⊢ (𝜑 → 𝑈 = 𝑅) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ⊆ wss 3574 ⊊ wpss 3575 class class class wbr 4653 ‘cfv 5888 LSubSpclss 18932 ⋖L clcv 34305 |
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-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 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-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 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-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-iota 5851 df-fun 5890 df-fv 5896 df-lcv 34306 |
This theorem is referenced by: lsatcveq0 34319 lsatcvatlem 34336 |
Copyright terms: Public domain | W3C validator |