NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  ssralv GIF version

Theorem ssralv 3331
Description: Quantification restricted to a subclass. (Contributed by NM, 11-Mar-2006.)
Assertion
Ref Expression
ssralv ⊢ (A ⊆ B → (∀x ∈ B φ → ∀x ∈ A φ))
Distinct variable groups:   x,A   x,B
Allowed substitution hint:   φ(x)

Proof of Theorem ssralv
StepHypRef Expression
1 ssel 3268 . . 3 ⊢ (A ⊆ B → (x ∈ A → x ∈ B))
21imim1d 69 . 2 ⊢ (A ⊆ B → ((x ∈ B → φ) → (x ∈ A → φ)))
32ralimdv2 2695 1 ⊢ (A ⊆ B → (∀x ∈ B φ → ∀x ∈ A φ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∈ wcel 1710  ∀wral 2615   ⊆ wss 3258
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334
This proof depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-ss 3260
This theorem is used by:  iinss1  3982  isoini2  5499
  Copyright terms: Public domain W3C validator