![]() |
Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > HSE Home > Th. List > cvnbtwn4 | Structured version Visualization version GIF version |
Description: The covers relation implies no in-betweenness. Part of proof of Lemma 7.5.1 of [MaedaMaeda] p. 31. (Contributed by NM, 12-Jun-2004.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cvnbtwn4 | ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cvnbtwn 31806 | . 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) | |
2 | iman 400 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ ¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
3 | an4 652 | . . . . 5 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵)) ↔ ((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵))) | |
4 | ioran 980 | . . . . . . 7 ⊢ (¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (¬ 𝐶 = 𝐴 ∧ ¬ 𝐶 = 𝐵)) | |
5 | eqcom 2737 | . . . . . . . . 9 ⊢ (𝐶 = 𝐴 ↔ 𝐴 = 𝐶) | |
6 | 5 | notbii 319 | . . . . . . . 8 ⊢ (¬ 𝐶 = 𝐴 ↔ ¬ 𝐴 = 𝐶) |
7 | 6 | anbi1i 622 | . . . . . . 7 ⊢ ((¬ 𝐶 = 𝐴 ∧ ¬ 𝐶 = 𝐵) ↔ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵)) |
8 | 4, 7 | bitri 274 | . . . . . 6 ⊢ (¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵)) |
9 | 8 | anbi2i 621 | . . . . 5 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵))) |
10 | dfpss2 4084 | . . . . . 6 ⊢ (𝐴 ⊊ 𝐶 ↔ (𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶)) | |
11 | dfpss2 4084 | . . . . . 6 ⊢ (𝐶 ⊊ 𝐵 ↔ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵)) | |
12 | 10, 11 | anbi12i 625 | . . . . 5 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵))) |
13 | 3, 9, 12 | 3bitr4i 302 | . . . 4 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)) |
14 | 13 | notbii 319 | . . 3 ⊢ (¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)) |
15 | 2, 14 | bitr2i 275 | . 2 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) |
16 | 1, 15 | imbitrdi 250 | 1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ⊆ wss 3947 ⊊ wpss 3948 class class class wbr 5147 Cℋ cch 30449 ⋖ℋ ccv 30484 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2722 df-clel 2808 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-br 5148 df-opab 5210 df-cv 31799 |
This theorem is referenced by: cvmdi 31844 |
Copyright terms: Public domain | W3C validator |