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

Theorem ssexOLD 5282
Description: Obsolete version of ssex 5281 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 4094 . 2 (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
2 ssex.1 . . . 4 𝐵 ∈ V
32inex2 5277 . . 3 (𝐴 ∩ 𝐵) ∈ V
4 eleq1 2848 . . 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 1569   ∈ wcel 2144  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-in 4091
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator