![]() |
Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HSE Home > Th. List > cvnbtwn | Structured version Visualization version GIF version |
Description: The covers relation implies no in-betweenness. (Contributed by NM, 12-Jun-2004.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cvnbtwn | ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cvbr 32310 | . . . 4 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)))) | |
2 | psseq2 4100 | . . . . . . . . 9 ⊢ (𝑥 = 𝐶 → (𝐴 ⊊ 𝑥 ↔ 𝐴 ⊊ 𝐶)) | |
3 | psseq1 4099 | . . . . . . . . 9 ⊢ (𝑥 = 𝐶 → (𝑥 ⊊ 𝐵 ↔ 𝐶 ⊊ 𝐵)) | |
4 | 2, 3 | anbi12d 632 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 → ((𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) |
5 | 4 | rspcev 3621 | . . . . . . 7 ⊢ ((𝐶 ∈ Cℋ ∧ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)) → ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)) |
6 | 5 | ex 412 | . . . . . 6 ⊢ (𝐶 ∈ Cℋ → ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) → ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵))) |
7 | 6 | con3rr3 155 | . . . . 5 ⊢ (¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵) → (𝐶 ∈ Cℋ → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) |
8 | 7 | adantl 481 | . . . 4 ⊢ ((𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)) → (𝐶 ∈ Cℋ → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) |
9 | 1, 8 | biimtrdi 253 | . . 3 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → (𝐶 ∈ Cℋ → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)))) |
10 | 9 | com23 86 | . 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐶 ∈ Cℋ → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)))) |
11 | 10 | 3impia 1116 | 1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1536 ∈ wcel 2105 ∃wrex 3067 ⊊ wpss 3963 class class class wbr 5147 Cℋ cch 30957 ⋖ℋ ccv 30992 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-sb 2062 df-clab 2712 df-cleq 2726 df-clel 2813 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-br 5148 df-opab 5210 df-cv 32307 |
This theorem is referenced by: cvnbtwn2 32315 cvnbtwn3 32316 cvnbtwn4 32317 cvntr 32320 |
Copyright terms: Public domain | W3C validator |