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

Theorem oprcl 4459
 Description: If an ordered pair has an element, then its arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
oprcl (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))

Proof of Theorem oprcl
StepHypRef Expression
1 n0i 3953 . 2 (𝐶 ∈ ⟨𝐴, 𝐵⟩ → ¬ ⟨𝐴, 𝐵⟩ = ∅)
2 opprc 4456 . 2 (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐴, 𝐵⟩ = ∅)
31, 2nsyl2 142 1 (𝐶 ∈ ⟨𝐴, 𝐵⟩ → (𝐴 ∈ V ∧ 𝐵 ∈ V))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1523   ∈ wcel 2030  Vcvv 3231  ∅c0 3948  ⟨cop 4216 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-v 3233  df-dif 3610  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-op 4217 This theorem is referenced by:  opth1  4973  opth  4974  0nelop  4989
 Copyright terms: Public domain W3C validator