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

Theorem opelresgOLD 5546
Description: Old proof of opelresg 5540. Obsolete as of 18-Feb-2022. (Contributed by NM, 14-Oct-2005.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
opelresgOLD (𝐵𝑉 → (⟨𝐴, 𝐵⟩ ∈ (𝐶𝐷) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐶𝐴𝐷)))

Proof of Theorem opelresgOLD
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 opeq2 4540 . . 3 (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
21eleq1d 2835 . 2 (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ (𝐶𝐷) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐶𝐷)))
31eleq1d 2835 . . 3 (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
43anbi1d 615 . 2 (𝑦 = 𝐵 → ((⟨𝐴, 𝑦⟩ ∈ 𝐶𝐴𝐷) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐶𝐴𝐷)))
5 vex 3354 . . 3 𝑦 ∈ V
65opelres 5542 . 2 (⟨𝐴, 𝑦⟩ ∈ (𝐶𝐷) ↔ (⟨𝐴, 𝑦⟩ ∈ 𝐶𝐴𝐷))
72, 4, 6vtoclbg 3418 1 (𝐵𝑉 → (⟨𝐴, 𝐵⟩ ∈ (𝐶𝐷) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐶𝐴𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382   = wceq 1631  wcel 2145  cop 4322  cres 5251
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pr 5034
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3353  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-nul 4064  df-if 4226  df-sn 4317  df-pr 4319  df-op 4323  df-opab 4847  df-xp 5255  df-res 5261
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator