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

Theorem iinexg 5208
Description: The existence of a class intersection. 𝑥 is normally a free-variable parameter in 𝐵, which should be read 𝐵(𝑥). (Contributed by FL, 19-Sep-2011.)
Assertion
Ref Expression
iinexg ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → 𝑥𝐴 𝐵 ∈ V)
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem iinexg
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfiin2g 4919 . . 3 (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
21adantl 485 . 2 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
3 elisset 3452 . . . . . . . . 9 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵)
43rgenw 3118 . . . . . . . 8 𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵)
5 r19.2z 4398 . . . . . . . 8 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵)) → ∃𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵))
64, 5mpan2 690 . . . . . . 7 (𝐴 ≠ ∅ → ∃𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵))
7 r19.35 3295 . . . . . . 7 (∃𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵) ↔ (∀𝑥𝐴 𝐵𝐶 → ∃𝑥𝐴𝑦 𝑦 = 𝐵))
86, 7sylib 221 . . . . . 6 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝐵𝐶 → ∃𝑥𝐴𝑦 𝑦 = 𝐵))
98imp 410 . . . . 5 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → ∃𝑥𝐴𝑦 𝑦 = 𝐵)
10 rexcom4 3212 . . . . 5 (∃𝑥𝐴𝑦 𝑦 = 𝐵 ↔ ∃𝑦𝑥𝐴 𝑦 = 𝐵)
119, 10sylib 221 . . . 4 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → ∃𝑦𝑥𝐴 𝑦 = 𝐵)
12 abn0 4290 . . . 4 ({𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≠ ∅ ↔ ∃𝑦𝑥𝐴 𝑦 = 𝐵)
1311, 12sylibr 237 . . 3 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≠ ∅)
14 intex 5204 . . 3 ({𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≠ ∅ ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
1513, 14sylib 221 . 2 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
162, 15eqeltrd 2890 1 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → 𝑥𝐴 𝐵 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wex 1781  wcel 2111  {cab 2776  wne 2987  wral 3106  wrex 3107  Vcvv 3441  c0 4243   cint 4838   ciin 4882
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-dif 3884  df-in 3888  df-ss 3898  df-nul 4244  df-int 4839  df-iin 4884
This theorem is referenced by:  fclsval  22613  taylfval  24954  iinexd  41769  smflimlem1  43404  smfliminflem  43461
  Copyright terms: Public domain W3C validator