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

Theorem iinexg 5244
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 4957 . . 3 (∀𝑥𝐴 𝐵𝐶 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
21adantl 484 . 2 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → 𝑥𝐴 𝐵 = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵})
3 elisset 3505 . . . . . . . . 9 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵)
43rgenw 3150 . . . . . . . 8 𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵)
5 r19.2z 4440 . . . . . . . 8 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵)) → ∃𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵))
64, 5mpan2 689 . . . . . . 7 (𝐴 ≠ ∅ → ∃𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵))
7 r19.35 3341 . . . . . . 7 (∃𝑥𝐴 (𝐵𝐶 → ∃𝑦 𝑦 = 𝐵) ↔ (∀𝑥𝐴 𝐵𝐶 → ∃𝑥𝐴𝑦 𝑦 = 𝐵))
86, 7sylib 220 . . . . . 6 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝐵𝐶 → ∃𝑥𝐴𝑦 𝑦 = 𝐵))
98imp 409 . . . . 5 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → ∃𝑥𝐴𝑦 𝑦 = 𝐵)
10 rexcom4 3249 . . . . 5 (∃𝑥𝐴𝑦 𝑦 = 𝐵 ↔ ∃𝑦𝑥𝐴 𝑦 = 𝐵)
119, 10sylib 220 . . . 4 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → ∃𝑦𝑥𝐴 𝑦 = 𝐵)
12 abn0 4336 . . . 4 ({𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≠ ∅ ↔ ∃𝑦𝑥𝐴 𝑦 = 𝐵)
1311, 12sylibr 236 . . 3 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≠ ∅)
14 intex 5240 . . 3 ({𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ≠ ∅ ↔ {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
1513, 14sylib 220 . 2 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵} ∈ V)
162, 15eqeltrd 2913 1 ((𝐴 ≠ ∅ ∧ ∀𝑥𝐴 𝐵𝐶) → 𝑥𝐴 𝐵 ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wex 1780  wcel 2114  {cab 2799  wne 3016  wral 3138  wrex 3139  Vcvv 3494  c0 4291   cint 4876   ciin 4920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-nul 4292  df-int 4877  df-iin 4922
This theorem is referenced by:  fclsval  22616  taylfval  24947  iinexd  41420  smflimlem1  43067  smfliminflem  43124
  Copyright terms: Public domain W3C validator