MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brabv Structured version   Visualization version   GIF version

Theorem brabv 6933
Description: If two classes are in a relationship given by an ordered-pair class abstraction, the classes are sets. (Contributed by Alexander van der Vekens, 5-Nov-2017.)
Assertion
Ref Expression
brabv (𝑋{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑌 → (𝑋 ∈ V ∧ 𝑌 ∈ V))

Proof of Theorem brabv
StepHypRef Expression
1 df-br 4844 . 2 (𝑋{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
2 opprc 4616 . . . 4 (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ⟨𝑋, 𝑌⟩ = ∅)
3 0neqopab 6932 . . . . 5 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
4 eleq1 2866 . . . . 5 (⟨𝑋, 𝑌⟩ = ∅ → (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
53, 4mtbiri 319 . . . 4 (⟨𝑋, 𝑌⟩ = ∅ → ¬ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
62, 5syl 17 . . 3 (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ¬ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
76con4i 114 . 2 (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → (𝑋 ∈ V ∧ 𝑌 ∈ V))
81, 7sylbi 209 1 (𝑋{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑌 → (𝑋 ∈ V ∧ 𝑌 ∈ V))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 385   = wceq 1653  wcel 2157  Vcvv 3385  c0 4115  cop 4374   class class class wbr 4843  {copab 4905
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777  ax-sep 4975  ax-nul 4983  ax-pr 5097
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ne 2972  df-v 3387  df-dif 3772  df-un 3774  df-in 3776  df-ss 3783  df-nul 4116  df-if 4278  df-sn 4369  df-pr 4371  df-op 4375  df-br 4844  df-opab 4906
This theorem is referenced by:  brfvopab  6934  bropopvvv  7492  bropfvvvvlem  7493  isfunc  16838  eqgval  17956  rgrprop  26810  rusgrprop  26812  upwlkbprop  42518
  Copyright terms: Public domain W3C validator