Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ssdf2 Structured version   Visualization version   GIF version

Theorem ssdf2 46292
Description: A sufficient condition for a subclass relationship. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
Hypotheses
Ref Expression
ssdf2.p Ⅎ𝑥𝜑
ssdf2.a Ⅎ𝑥𝐴
ssdf2.b Ⅎ𝑥𝐵
ssdf2.x ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
Assertion
Ref Expression
ssdf2 (𝜑 → 𝐴 ⊆ 𝐵)

Proof of Theorem ssdf2
StepHypRef Expression
1 ssdf2.p . 2 Ⅎ𝑥𝜑
2 ssdf2.a . 2 Ⅎ𝑥𝐴
3 ssdf2.b . 2 Ⅎ𝑥𝐵
4 ssdf2.x . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐵)
54ex 418 . 2 (𝜑 → (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
61, 2, 3, 5ssrd 3914 1 (𝜑 → 𝐴 ⊆ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  Ⅎwnf 1815   ∈ wcel 2144  Ⅎwnfc 2907   ⊆ wss 3896
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-11 2193  ax-12 2212
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-nf 1816  df-clel 2835  df-nfc 2909  df-ss 3897
This theorem is used by:  supminfxr2  46615  pimiooltgt  47856  sssmf  47884  fsupdm  47988  finfdm  47992
  Copyright terms: Public domain W3C validator