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

Theorem prexOLD 5400
Description: Obsolete version of prex 5395 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 4694 . . . . . 6 (𝑦 = 𝐵 → {𝑥, 𝑦} = {𝑥, 𝐵})
21eleq1d 2845 . . . . 5 (𝑦 = 𝐵 → ({𝑥, 𝑦} ∈ V ↔ {𝑥, 𝐵} ∈ V))
3 zfpair2 5391 . . . . 5 {𝑥, 𝑦} ∈ V
42, 3vtoclg 3517 . . . 4 (𝐵 ∈ V → {𝑥, 𝐵} ∈ V)
5 preq1 4693 . . . . 5 (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
65eleq1d 2845 . . . 4 (𝑥 = 𝐴 → ({𝑥, 𝐵} ∈ V ↔ {𝐴, 𝐵} ∈ V))
74, 6imbitrid 247 . . 3 (𝑥 = 𝐴 → (𝐵 ∈ V → {𝐴, 𝐵} ∈ V))
87vtocleg 3516 . 2 (𝐴 ∈ V → (𝐵 ∈ V → {𝐴, 𝐵} ∈ V))
9 prprc1 4725 . . 3 (¬ 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵})
10 snexOLD 5399 . . 3 {𝐵} ∈ V
119, 10eqeltrdi 2868 . 2 (¬ 𝐴 ∈ V → {𝐴, 𝐵} ∈ V)
12 prprc2 4726 . . 3 (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴})
13 snexOLD 5399 . . 3 {𝐴} ∈ V
1412, 13eqeltrdi 2868 . 2 (¬ 𝐵 ∈ V → {𝐴, 𝐵} ∈ V)
158, 11, 14pm2.61nii 186 1 {𝐴, 𝐵} ∈ V
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3450  {csn 4583  {cpr 4585
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-v 3452  df-dif 3901  df-un 3903  df-nul 4279  df-sn 4584  df-pr 4586
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator