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

Theorem brabv 5426
 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 5040 . 2 (𝑋{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
2 opprc 4799 . . . 4 (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ⟨𝑋, 𝑌⟩ = ∅)
3 0nelopab 5425 . . . . 5 ¬ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}
4 eleq1 2899 . . . . 5 (⟨𝑋, 𝑌⟩ = ∅ → (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∅ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
53, 4mtbiri 330 . . . 4 (⟨𝑋, 𝑌⟩ = ∅ → ¬ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
62, 5syl 17 . . 3 (¬ (𝑋 ∈ V ∧ 𝑌 ∈ V) → ¬ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
76con4i 114 . 2 (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} → (𝑋 ∈ V ∧ 𝑌 ∈ V))
81, 7sylbi 220 1 (𝑋{⟨𝑥, 𝑦⟩ ∣ 𝜑}𝑌 → (𝑋 ∈ V ∧ 𝑌 ∈ V))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   = wceq 1538   ∈ wcel 2115  Vcvv 3471  ∅c0 4266  ⟨cop 4546   class class class wbr 5039  {copab 5101 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pr 5303 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 2071  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-v 3473  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-sn 4541  df-pr 4543  df-op 4547  df-br 5040  df-opab 5102 This theorem is referenced by:  brfvopab  7185  bropopvvv  7760  bropfvvvvlem  7761  isfunc  17112  eqgval  18307  bj-imdirval3  34490  upwlkbprop  44160
 Copyright terms: Public domain W3C validator