HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  cvbr Structured version   Visualization version   GIF version

Theorem cvbr 29475
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.
StepHypRef Expression
1 eleq1 2880 . . . . 5 (𝑦 = 𝐴 → (𝑦C𝐴C ))
21anbi1d 617 . . . 4 (𝑦 = 𝐴 → ((𝑦C𝑧C ) ↔ (𝐴C𝑧C )))
3 psseq1 3899 . . . . 5 (𝑦 = 𝐴 → (𝑦𝑧𝐴𝑧))
4 psseq1 3899 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦𝑥𝐴𝑥))
54anbi1d 617 . . . . . . 7 (𝑦 = 𝐴 → ((𝑦𝑥𝑥𝑧) ↔ (𝐴𝑥𝑥𝑧)))
65rexbidv 3247 . . . . . 6 (𝑦 = 𝐴 → (∃𝑥C (𝑦𝑥𝑥𝑧) ↔ ∃𝑥C (𝐴𝑥𝑥𝑧)))
76notbid 309 . . . . 5 (𝑦 = 𝐴 → (¬ ∃𝑥C (𝑦𝑥𝑥𝑧) ↔ ¬ ∃𝑥C (𝐴𝑥𝑥𝑧)))
83, 7anbi12d 618 . . . 4 (𝑦 = 𝐴 → ((𝑦𝑧 ∧ ¬ ∃𝑥C (𝑦𝑥𝑥𝑧)) ↔ (𝐴𝑧 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝑧))))
92, 8anbi12d 618 . . 3 (𝑦 = 𝐴 → (((𝑦C𝑧C ) ∧ (𝑦𝑧 ∧ ¬ ∃𝑥C (𝑦𝑥𝑥𝑧))) ↔ ((𝐴C𝑧C ) ∧ (𝐴𝑧 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝑧)))))
10 eleq1 2880 . . . . 5 (𝑧 = 𝐵 → (𝑧C𝐵C ))
1110anbi2d 616 . . . 4 (𝑧 = 𝐵 → ((𝐴C𝑧C ) ↔ (𝐴C𝐵C )))
12 psseq2 3900 . . . . 5 (𝑧 = 𝐵 → (𝐴𝑧𝐴𝐵))
13 psseq2 3900 . . . . . . . 8 (𝑧 = 𝐵 → (𝑥𝑧𝑥𝐵))
1413anbi2d 616 . . . . . . 7 (𝑧 = 𝐵 → ((𝐴𝑥𝑥𝑧) ↔ (𝐴𝑥𝑥𝐵)))
1514rexbidv 3247 . . . . . 6 (𝑧 = 𝐵 → (∃𝑥C (𝐴𝑥𝑥𝑧) ↔ ∃𝑥C (𝐴𝑥𝑥𝐵)))
1615notbid 309 . . . . 5 (𝑧 = 𝐵 → (¬ ∃𝑥C (𝐴𝑥𝑥𝑧) ↔ ¬ ∃𝑥C (𝐴𝑥𝑥𝐵)))
1712, 16anbi12d 618 . . . 4 (𝑧 = 𝐵 → ((𝐴𝑧 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝑧)) ↔ (𝐴𝐵 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝐵))))
1811, 17anbi12d 618 . . 3 (𝑧 = 𝐵 → (((𝐴C𝑧C ) ∧ (𝐴𝑧 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝑧))) ↔ ((𝐴C𝐵C ) ∧ (𝐴𝐵 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝐵)))))
19 df-cv 29472 . . 3 = {⟨𝑦, 𝑧⟩ ∣ ((𝑦C𝑧C ) ∧ (𝑦𝑧 ∧ ¬ ∃𝑥C (𝑦𝑥𝑥𝑧)))}
209, 18, 19brabg 5196 . 2 ((𝐴C𝐵C ) → (𝐴 𝐵 ↔ ((𝐴C𝐵C ) ∧ (𝐴𝐵 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝐵)))))
2120bianabs 533 1 ((𝐴C𝐵C ) → (𝐴 𝐵 ↔ (𝐴𝐵 ∧ ¬ ∃𝑥C (𝐴𝑥𝑥𝐵))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 197  wa 384   = wceq 1637  wcel 2157  wrex 3104  wpss 3777   class class class wbr 4851   C cch 28120   ccv 28155
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2791  ax-sep 4982  ax-nul 4990  ax-pr 5103
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2638  df-clab 2800  df-cleq 2806  df-clel 2809  df-nfc 2944  df-ne 2986  df-rex 3109  df-rab 3112  df-v 3400  df-dif 3779  df-un 3781  df-in 3783  df-ss 3790  df-pss 3792  df-nul 4124  df-if 4287  df-sn 4378  df-pr 4380  df-op 4384  df-br 4852  df-opab 4914  df-cv 29472
This theorem is referenced by:  cvbr2  29476  cvcon3  29477  cvpss  29478  cvnbtwn  29479
  Copyright terms: Public domain W3C validator