![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > lcvnbtwn2 | Structured version Visualization version GIF version |
Description: The covers relation implies no in-betweenness. (cvnbtwn2 32049 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 | ⊢ (𝜑 → 𝑅𝐶𝑇) |
lcvnbtwn2.p | ⊢ (𝜑 → 𝑅 ⊊ 𝑈) |
lcvnbtwn2.q | ⊢ (𝜑 → 𝑈 ⊆ 𝑇) |
Ref | Expression |
---|---|
lcvnbtwn2 | ⊢ (𝜑 → 𝑈 = 𝑇) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | lcvnbtwn2.p | . 2 ⊢ (𝜑 → 𝑅 ⊊ 𝑈) | |
2 | lcvnbtwn2.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 38408 | . . 3 ⊢ (𝜑 → ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)) |
11 | iman 401 | . . . 4 ⊢ (((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) → 𝑈 = 𝑇) ↔ ¬ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇)) | |
12 | anass 468 | . . . . . 6 ⊢ (((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ (𝑈 ⊆ 𝑇 ∧ ¬ 𝑈 = 𝑇))) | |
13 | dfpss2 4080 | . . . . . . 7 ⊢ (𝑈 ⊊ 𝑇 ↔ (𝑈 ⊆ 𝑇 ∧ ¬ 𝑈 = 𝑇)) | |
14 | 13 | anbi2i 622 | . . . . . 6 ⊢ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ (𝑈 ⊆ 𝑇 ∧ ¬ 𝑈 = 𝑇))) |
15 | 12, 14 | bitr4i 278 | . . . . 5 ⊢ (((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)) |
16 | 15 | notbii 320 | . . . 4 ⊢ (¬ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) ∧ ¬ 𝑈 = 𝑇) ↔ ¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇)) |
17 | 11, 16 | bitr2i 276 | . . 3 ⊢ (¬ (𝑅 ⊊ 𝑈 ∧ 𝑈 ⊊ 𝑇) ↔ ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) → 𝑈 = 𝑇)) |
18 | 10, 17 | sylib 217 | . 2 ⊢ (𝜑 → ((𝑅 ⊊ 𝑈 ∧ 𝑈 ⊆ 𝑇) → 𝑈 = 𝑇)) |
19 | 1, 2, 18 | mp2and 696 | 1 ⊢ (𝜑 → 𝑈 = 𝑇) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ⊆ wss 3943 ⊊ wpss 3944 class class class wbr 5141 ‘cfv 6537 LSubSpclss 20778 ⋖L clcv 38401 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-ral 3056 df-rex 3065 df-rab 3427 df-v 3470 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-iota 6489 df-fun 6539 df-fv 6545 df-lcv 38402 |
This theorem is referenced by: lcvat 38413 lsatexch 38426 |
Copyright terms: Public domain | W3C validator |