![]() |
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 31807 | . 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))) | |
2 | iman 401 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ ¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) | |
3 | an4 653 | . . . . 5 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵)) ↔ ((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵))) | |
4 | ioran 981 | . . . . . . 7 ⊢ (¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (¬ 𝐶 = 𝐴 ∧ ¬ 𝐶 = 𝐵)) | |
5 | eqcom 2738 | . . . . . . . . 9 ⊢ (𝐶 = 𝐴 ↔ 𝐴 = 𝐶) | |
6 | 5 | notbii 320 | . . . . . . . 8 ⊢ (¬ 𝐶 = 𝐴 ↔ ¬ 𝐴 = 𝐶) |
7 | 6 | anbi1i 623 | . . . . . . 7 ⊢ ((¬ 𝐶 = 𝐴 ∧ ¬ 𝐶 = 𝐵) ↔ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵)) |
8 | 4, 7 | bitri 275 | . . . . . 6 ⊢ (¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵) ↔ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵)) |
9 | 8 | anbi2i 622 | . . . . 5 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ (¬ 𝐴 = 𝐶 ∧ ¬ 𝐶 = 𝐵))) |
10 | dfpss2 4085 | . . . . . 6 ⊢ (𝐴 ⊊ 𝐶 ↔ (𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶)) | |
11 | dfpss2 4085 | . . . . . 6 ⊢ (𝐶 ⊊ 𝐵 ↔ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵)) | |
12 | 10, 11 | anbi12i 626 | . . . . 5 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵))) |
13 | 3, 9, 12 | 3bitr4i 303 | . . . 4 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)) |
14 | 13 | notbii 320 | . . 3 ⊢ (¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)) ↔ ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)) |
15 | 2, 14 | bitr2i 276 | . 2 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵))) |
16 | 1, 15 | imbitrdi 250 | 1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) → (𝐶 = 𝐴 ∨ 𝐶 = 𝐵)))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 844 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 ⊆ wss 3948 ⊊ wpss 3949 class class class wbr 5148 Cℋ cch 30450 ⋖ℋ ccv 30485 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-cv 31800 |
This theorem is referenced by: cvmdi 31845 |
Copyright terms: Public domain | W3C validator |