Theorem cvnbtwn2 32311

Description: The covers relation implies no in-betweenness. (Contributed by NM, 12-Jun-2004.) (New usage is discouraged.)

Assertion

Ref	Expression
cvnbtwn2	⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵)))

Proof of Theorem cvnbtwn2

Step	Hyp	Ref	Expression
1		cvnbtwn 32310	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)))
2		iman 401	. . 3 ⊢ (((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵) ↔ ¬ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵))
3		anass 468	. . . . 5 ⊢ (((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵)))
4		dfpss2 4038	. . . . . 6 ⊢ (𝐶 ⊊ 𝐵 ↔ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵))
5	4	anbi2i 623	. . . . 5 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ (𝐶 ⊆ 𝐵 ∧ ¬ 𝐶 = 𝐵)))
6	3, 5	bitr4i 278	. . . 4 ⊢ (((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵) ↔ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))
7	6	notbii 320	. . 3 ⊢ (¬ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) ∧ ¬ 𝐶 = 𝐵) ↔ ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵))
8	2, 7	bitr2i 276	. 2 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵))
9	1, 8	imbitrdi 251	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊆ 𝐵) → 𝐶 = 𝐵)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ⊆ wss 3899   ⊊ wpss 3900   class class class wbr 5096   C_ℋ cch 30953   ⋖_ℋ ccv 30988

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 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-br 5097  df-opab 5159  df-cv 32303

This theorem is referenced by:  cvati  32390  cvexchlem  32392  atexch  32405