Theorem cvbr 30065

Description: Binary relation expressing 𝐵 covers 𝐴, which means that 𝐵 is larger than 𝐴 and there is nothing in between. Definition 3.2.18 of [PtakPulmannova] p. 68. (Contributed by NM, 4-Jun-2004.) (New usage is discouraged.)

Assertion

Ref	Expression
cvbr	⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵))))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem cvbr

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq1 2877	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝑦 ∈ Cℋ ↔ 𝐴 ∈ Cℋ ))
2	1	anbi1d 632	. . . 4 ⊢ (𝑦 = 𝐴 → ((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ )))
3		psseq1 4015	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝑦 ⊊ 𝑧 ↔ 𝐴 ⊊ 𝑧))
4		psseq1 4015	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑦 ⊊ 𝑥 ↔ 𝐴 ⊊ 𝑥))
5	4	anbi1d 632	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑦 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧) ↔ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)))
6	5	rexbidv 3256	. . . . . 6 ⊢ (𝑦 = 𝐴 → (∃𝑥 ∈ Cℋ (𝑦 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧) ↔ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)))
7	6	notbid 321	. . . . 5 ⊢ (𝑦 = 𝐴 → (¬ ∃𝑥 ∈ Cℋ (𝑦 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧) ↔ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)))
8	3, 7	anbi12d 633	. . . 4 ⊢ (𝑦 = 𝐴 → ((𝑦 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝑦 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)) ↔ (𝐴 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧))))
9	2, 8	anbi12d 633	. . 3 ⊢ (𝑦 = 𝐴 → (((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ (𝑦 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝑦 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧))) ↔ ((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ (𝐴 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)))))
10		eleq1 2877	. . . . 5 ⊢ (𝑧 = 𝐵 → (𝑧 ∈ Cℋ ↔ 𝐵 ∈ Cℋ ))
11	10	anbi2d 631	. . . 4 ⊢ (𝑧 = 𝐵 → ((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ )))
12		psseq2 4016	. . . . 5 ⊢ (𝑧 = 𝐵 → (𝐴 ⊊ 𝑧 ↔ 𝐴 ⊊ 𝐵))
13		psseq2 4016	. . . . . . . 8 ⊢ (𝑧 = 𝐵 → (𝑥 ⊊ 𝑧 ↔ 𝑥 ⊊ 𝐵))
14	13	anbi2d 631	. . . . . . 7 ⊢ (𝑧 = 𝐵 → ((𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧) ↔ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)))
15	14	rexbidv 3256	. . . . . 6 ⊢ (𝑧 = 𝐵 → (∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧) ↔ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)))
16	15	notbid 321	. . . . 5 ⊢ (𝑧 = 𝐵 → (¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧) ↔ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)))
17	12, 16	anbi12d 633	. . . 4 ⊢ (𝑧 = 𝐵 → ((𝐴 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)) ↔ (𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵))))
18	11, 17	anbi12d 633	. . 3 ⊢ (𝑧 = 𝐵 → (((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ (𝐴 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧))) ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ (𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)))))
19		df-cv 30062	. . 3 ⊢ ⋖ℋ = {⟨𝑦, 𝑧⟩ ∣ ((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ (𝑦 ⊊ 𝑧 ∧ ¬ ∃𝑥 ∈ Cℋ (𝑦 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝑧)))}
20	9, 18, 19	brabg 5391	. 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ (𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵)))))
21	20	bianabs 545	1 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 ⋖ℋ 𝐵 ↔ (𝐴 ⊊ 𝐵 ∧ ¬ ∃𝑥 ∈ Cℋ (𝐴 ⊊ 𝑥 ∧ 𝑥 ⊊ 𝐵))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∃wrex 3107   ⊊ wpss 3882   class class class wbr 5030   C_ℋ cch 28712   ⋖_ℋ ccv 28747

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-rex 3112  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-br 5031  df-opab 5093  df-cv 30062

This theorem is referenced by:  cvbr2  30066  cvcon3  30067  cvpss  30068  cvnbtwn  30069