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

Theorem ssexOLD 5283
Description: Obsolete version of ssex 5282 as of 18-Jul-2026. (Contributed by NM, 27-Apr-1994.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
ssex.1 𝐵 ∈ V
Assertion
Ref Expression
ssexOLD (𝐴 ⊆ 𝐵 → 𝐴 ∈ V)

Proof of Theorem ssexOLD
StepHypRef Expression
1 dfss2 3917 . 2 (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
2 ssex.1 . . . 4 𝐵 ∈ V
32inex2 5278 . . 3 (𝐴 ∩ 𝐵) ∈ V
4 eleq1 2849 . . 3 ((𝐴 ∩ 𝐵) = 𝐴 → ((𝐴 ∩ 𝐵) ∈ V ↔ 𝐴 ∈ V))
53, 4mpbii 236 . 2 ((𝐴 ∩ 𝐵) = 𝐴 → 𝐴 ∈ V)
61, 5sylbi 220 1 (𝐴 ⊆ 𝐵 → 𝐴 ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899
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 2733  ax-sep 5249
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-in 3906  df-ss 3916
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator