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

Theorem unexbOLD 7727
Description: Obsolete version of unexb 7726 as of 21-Jul-2025. (Contributed by NM, 11-Jun-1998.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
unexbOLD ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴𝐵) ∈ V)

Proof of Theorem unexbOLD
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uneq1 4114 . . . 4 (𝑥 = 𝐴 → (𝑥𝑦) = (𝐴𝑦))
21eleq1d 2846 . . 3 (𝑥 = 𝐴 → ((𝑥𝑦) ∈ V ↔ (𝐴𝑦) ∈ V))
3 uneq2 4115 . . . 4 (𝑦 = 𝐵 → (𝐴𝑦) = (𝐴𝐵))
43eleq1d 2846 . . 3 (𝑦 = 𝐵 → ((𝐴𝑦) ∈ V ↔ (𝐴𝐵) ∈ V))
5 vex 3457 . . . 4 𝑥 ∈ V
6 vex 3457 . . . 4 𝑦 ∈ V
75, 6unex 7723 . . 3 (𝑥𝑦) ∈ V
82, 4, 7vtocl2g 3538 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴𝐵) ∈ V)
9 ssun1 4130 . . . 4 𝐴 ⊆ (𝐴𝐵)
10 ssexg 5278 . . . 4 ((𝐴 ⊆ (𝐴𝐵) ∧ (𝐴𝐵) ∈ V) → 𝐴 ∈ V)
119, 10mpan 700 . . 3 ((𝐴𝐵) ∈ V → 𝐴 ∈ V)
12 ssun2 4131 . . . 4 𝐵 ⊆ (𝐴𝐵)
13 ssexg 5278 . . . 4 ((𝐵 ⊆ (𝐴𝐵) ∧ (𝐴𝐵) ∈ V) → 𝐵 ∈ V)
1412, 13mpan 700 . . 3 ((𝐴𝐵) ∈ V → 𝐵 ∈ V)
1511, 14jca 519 . 2 ((𝐴𝐵) ∈ V → (𝐴 ∈ V ∧ 𝐵 ∈ V))
168, 15impbii 211 1 ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐴𝐵) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399   = wceq 1559  wcel 2141  Vcvv 3453  cun 3902  wss 3904
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3455  df-un 3909  df-in 3911  df-ss 3921  df-sn 4582  df-pr 4584  df-uni 4865
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator