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

Theorem unexOLD 7696
Description: Obsolete version of unex 7695 as of 21-Jul-2025. (Contributed by NM, 1-Jul-1994.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
unex.1 𝐴 ∈ V
unex.2 𝐵 ∈ V
Assertion
Ref Expression
unexOLD (𝐴𝐵) ∈ V

Proof of Theorem unexOLD
StepHypRef Expression
1 unex.1 . . 3 𝐴 ∈ V
2 unex.2 . . 3 𝐵 ∈ V
31, 2unipr 4868 . 2 {𝐴, 𝐵} = (𝐴𝐵)
4 prex 5379 . . 3 {𝐴, 𝐵} ∈ V
54uniex 7692 . 2 {𝐴, 𝐵} ∈ V
63, 5eqeltrri 2834 1 (𝐴𝐵) ∈ V
Colors of variables: wff setvar class
Syntax hints:  wcel 2114  Vcvv 3430  cun 3888  {cpr 4570   cuni 4851
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 5232  ax-pr 5374  ax-un 7686
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-v 3432  df-un 3895  df-ss 3907  df-sn 4569  df-pr 4571  df-uni 4852
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator