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

Theorem riinn0 5051
Description: Relative intersection of a nonempty family. (Contributed by Stefan O'Rear, 3-Apr-2015.)
Assertion
Ref Expression
riinn0 ((∀𝑥𝑋 𝑆𝐴𝑋 ≠ ∅) → (𝐴 𝑥𝑋 𝑆) = 𝑥𝑋 𝑆)
Distinct variable groups:   𝑥,𝐴   𝑥,𝑋
Allowed substitution hint:   𝑆(𝑥)

Proof of Theorem riinn0
StepHypRef Expression
1 incom 4162 . 2 (𝐴 𝑥𝑋 𝑆) = ( 𝑥𝑋 𝑆𝐴)
2 r19.2z 4462 . . . . 5 ((𝑋 ≠ ∅ ∧ ∀𝑥𝑋 𝑆𝐴) → ∃𝑥𝑋 𝑆𝐴)
32ancoms 464 . . . 4 ((∀𝑥𝑋 𝑆𝐴𝑋 ≠ ∅) → ∃𝑥𝑋 𝑆𝐴)
4 iinss 5023 . . . 4 (∃𝑥𝑋 𝑆𝐴 𝑥𝑋 𝑆𝐴)
53, 4syl 18 . . 3 ((∀𝑥𝑋 𝑆𝐴𝑋 ≠ ∅) → 𝑥𝑋 𝑆𝐴)
6 dfss2 3924 . . 3 ( 𝑥𝑋 𝑆𝐴 ↔ ( 𝑥𝑋 𝑆𝐴) = 𝑥𝑋 𝑆)
75, 6sylib 221 . 2 ((∀𝑥𝑋 𝑆𝐴𝑋 ≠ ∅) → ( 𝑥𝑋 𝑆𝐴) = 𝑥𝑋 𝑆)
81, 7eqtrid 2812 1 ((∀𝑥𝑋 𝑆𝐴𝑋 ≠ ∅) → (𝐴 𝑥𝑋 𝑆) = 𝑥𝑋 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wne 2960  wral 3081  wrex 3091  cin 3905  wss 3906  c0 4286   ciin 4959
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 2148  ax-9 2156  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-in 3913  df-ss 3923  df-nul 4287  df-iin 4961
This theorem is used by:  riinrab  5052  riiner  8794  mreriincl  17674  riinopn  23117  alexsublem  24254  fnemeet1  36936
  Copyright terms: Public domain W3C validator