Users' Mathboxes Mathbox for Jeff Hankins < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fneint Structured version   Visualization version   GIF version

Theorem fneint 37351
Description: If a cover is finer than another, every point can be approached more closely by intersections. (Contributed by Jeff Hankins, 11-Oct-2009.)
Assertion
Ref Expression
fneint (𝐴Fne𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ ∩ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑃

Proof of Theorem fneint
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq2w 2848 . . . . 5 (𝑥 = 𝑦 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑦))
21elrab 3648 . . . 4 (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥} ↔ (𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦))
3 fnessex 37349 . . . . . . 7 ((𝐴Fne𝐵 ∧ 𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦) → ∃𝑧 ∈ 𝐵 (𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))
433expb 1138 . . . . . 6 ((𝐴Fne𝐵 ∧ (𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦)) → ∃𝑧 ∈ 𝐵 (𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦))
5 eleq2w 2848 . . . . . . . . . 10 (𝑥 = 𝑧 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑧))
65intminss 4939 . . . . . . . . 9 ((𝑧 ∈ 𝐵 ∧ 𝑃 ∈ 𝑧) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑧)
7 sstr 3921 . . . . . . . . 9 ((∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑧 ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)
86, 7sylan 592 . . . . . . . 8 (((𝑧 ∈ 𝐵 ∧ 𝑃 ∈ 𝑧) ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)
98expl 463 . . . . . . 7 (𝑧 ∈ 𝐵 → ((𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦))
109rexlimiv 3160 . . . . . 6 (∃𝑧 ∈ 𝐵 (𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)
114, 10syl 18 . . . . 5 ((𝐴Fne𝐵 ∧ (𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦)) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)
1211ex 418 . . . 4 (𝐴Fne𝐵 → ((𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦))
132, 12biimtrid 245 . . 3 (𝐴Fne𝐵 → (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥} → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦))
1413ralrimiv 3157 . 2 (𝐴Fne𝐵 → ∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥}∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)
15 ssint 4929 . 2 (∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ ∩ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥} ↔ ∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥}∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)
1614, 15sylibr 237 1 (𝐴Fne𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ ∩ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  {crab 3416   ⊆ wss 3900  ∩ cint 4912   class class class wbr 5108  Fnecfne 37339
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-topgen 17664  df-fne 37340
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator