Theorem cvnbtwn3 32268

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

Assertion

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

Proof of Theorem cvnbtwn3

Step	Hyp	Ref	Expression
1		cvnbtwn 32266	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵)))
2		iman 401	. . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐴 = 𝐶) ↔ ¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
3		eqcom 2738	. . . 4 ⊢ (𝐶 = 𝐴 ↔ 𝐴 = 𝐶)
4	3	imbi2i 336	. . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐶 = 𝐴) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐴 = 𝐶))
5		dfpss2 4035	. . . . . 6 ⊢ (𝐴 ⊊ 𝐶 ↔ (𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶))
6	5	anbi1i 624	. . . . 5 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ 𝐶 ⊊ 𝐵))
7		an32 646	. . . . 5 ⊢ (((𝐴 ⊆ 𝐶 ∧ ¬ 𝐴 = 𝐶) ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
8	6, 7	bitri 275	. . . 4 ⊢ ((𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
9	8	notbii 320	. . 3 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ¬ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) ∧ ¬ 𝐴 = 𝐶))
10	2, 4, 9	3bitr4ri 304	. 2 ⊢ (¬ (𝐴 ⊊ 𝐶 ∧ 𝐶 ⊊ 𝐵) ↔ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐶 = 𝐴))
11	1, 10	imbitrdi 251	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 → ((𝐴 ⊆ 𝐶 ∧ 𝐶 ⊊ 𝐵) → 𝐶 = 𝐴)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111   ⊆ wss 3897   ⊊ wpss 3898   class class class wbr 5089   C_ℋ cch 30909   ⋖_ℋ ccv 30944

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 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368

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 2710  df-cleq 2723  df-clel 2806  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-br 5090  df-opab 5152  df-cv 32259

This theorem is referenced by:  atcveq0  32328  atcvatlem  32365