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

Theorem prexOLD 5389
Description: Obsolete version of prex 5384 as of 6-Mar-2026. (Contributed by NM, 15-Jul-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
prexOLD {𝐴, 𝐵} ∈ V

Proof of Theorem prexOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 preq2 4693 . . . . . 6 (𝑦 = 𝐵 → {𝑥, 𝑦} = {𝑥, 𝐵})
21eleq1d 2822 . . . . 5 (𝑦 = 𝐵 → ({𝑥, 𝑦} ∈ V ↔ {𝑥, 𝐵} ∈ V))
3 zfpair2 5380 . . . . 5 {𝑥, 𝑦} ∈ V
42, 3vtoclg 3513 . . . 4 (𝐵 ∈ V → {𝑥, 𝐵} ∈ V)
5 preq1 4692 . . . . 5 (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
65eleq1d 2822 . . . 4 (𝑥 = 𝐴 → ({𝑥, 𝐵} ∈ V ↔ {𝐴, 𝐵} ∈ V))
74, 6imbitrid 244 . . 3 (𝑥 = 𝐴 → (𝐵 ∈ V → {𝐴, 𝐵} ∈ V))
87vtocleg 3512 . 2 (𝐴 ∈ V → (𝐵 ∈ V → {𝐴, 𝐵} ∈ V))
9 prprc1 4724 . . 3 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
10 snexOLD 5388 . . 3 {𝐵} ∈ V
119, 10eqeltrdi 2845 . 2 𝐴 ∈ V → {𝐴, 𝐵} ∈ V)
12 prprc2 4725 . . 3 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴})
13 snexOLD 5388 . . 3 {𝐴} ∈ V
1412, 13eqeltrdi 2845 . 2 𝐵 ∈ V → {𝐴, 𝐵} ∈ V)
158, 11, 14pm2.61nii 184 1 {𝐴, 𝐵} ∈ V
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  {csn 4582  {cpr 4584
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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3444  df-dif 3906  df-un 3908  df-nul 4288  df-sn 4583  df-pr 4585
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator