Theorem cvnbtwn3t 5720

Description: The covering relation implies no in-betweenness.

Assertion

Ref	Expression
cvnbtwn3t	⊢ ((A ∈ Cℋ ∧ B ∈ Cℋ ∧ C ∈ Cℋ ) → (A ⋖ B → ((A ⊆ C ∧ C ⊂ B) → C = A)))

Proof of Theorem cvnbtwn3t

Step	Hyp	Ref	Expression
1		cvnbtwnt 5718	. 2 ⊢ ((A ∈ Cℋ ∧ B ∈ Cℋ ∧ C ∈ Cℋ ) → (A ⋖ B → ¬ (A ⊂ C ∧ C ⊂ B)))
2		iman 205	. . 3 ⊢ (((A ⊆ C ∧ C ⊂ B) → A = C) ↔ ¬ ((A ⊆ C ∧ C ⊂ B) ∧ ¬ A = C))
3		cleqcom 1103	. . . 4 ⊢ (C = A ↔ A = C)
4	3	imbi2i 160	. . 3 ⊢ (((A ⊆ C ∧ C ⊂ B) → C = A) ↔ ((A ⊆ C ∧ C ⊂ B) → A = C))
5		dfpss2 1557	. . . . . 6 ⊢ (A ⊂ C ↔ (A ⊆ C ∧ ¬ A = C))
6	5	anbi1i 368	. . . . 5 ⊢ ((A ⊂ C ∧ C ⊂ B) ↔ ((A ⊆ C ∧ ¬ A = C) ∧ C ⊂ B))
7		an23 371	. . . . 5 ⊢ (((A ⊆ C ∧ ¬ A = C) ∧ C ⊂ B) ↔ ((A ⊆ C ∧ C ⊂ B) ∧ ¬ A = C))
8	6, 7	bitr 151	. . . 4 ⊢ ((A ⊂ C ∧ C ⊂ B) ↔ ((A ⊆ C ∧ C ⊂ B) ∧ ¬ A = C))
9	8	negbii 162	. . 3 ⊢ (¬ (A ⊂ C ∧ C ⊂ B) ↔ ¬ ((A ⊆ C ∧ C ⊂ B) ∧ ¬ A = C))
10	2, 4, 9	3bitr4r 159	. 2 ⊢ (¬ (A ⊂ C ∧ C ⊂ B) ↔ ((A ⊆ C ∧ C ⊂ B) → C = A))
11	1, 10	syl6ib 185	1 ⊢ ((A ∈ Cℋ ∧ B ∈ Cℋ ∧ C ∈ Cℋ ) → (A ⋖ B → ((A ⊆ C ∧ C ⊂ B) → C = A)))

Syntax hints:  ¬ wn 1   → wi 2   ∧ wa 196   ∧ w3a 581   = wceq 1091   ∈ wcel 1092   ⊆ wss 1487   ⊂ wpss 1488   class class class wbr 2054   C_ℋ cch 4968   ⋖ ccv 4981

This theorem is referenced by:  atcveq0 5746  atcvatlem 5770

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-pss 1494  df-nul 1708  df-pw 1799  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063  df-opab 2098  df-cv 5712

metamath.org