Mathbox for Jeff Hankins |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > fneint | Structured version Visualization version GIF version |
Description: If a cover is finer than another, every point can be approached more closely by intersections. (Contributed by Jeff Hankins, 11-Oct-2009.) |
Ref | Expression |
---|---|
fneint | ⊢ (𝐴Fne𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ ∩ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq2w 2822 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑦)) | |
2 | 1 | elrab 3624 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥} ↔ (𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦)) |
3 | fnessex 34535 | . . . . . . 7 ⊢ ((𝐴Fne𝐵 ∧ 𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦) → ∃𝑧 ∈ 𝐵 (𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) | |
4 | 3 | 3expb 1119 | . . . . . 6 ⊢ ((𝐴Fne𝐵 ∧ (𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦)) → ∃𝑧 ∈ 𝐵 (𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦)) |
5 | eleq2w 2822 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑧 → (𝑃 ∈ 𝑥 ↔ 𝑃 ∈ 𝑧)) | |
6 | 5 | intminss 4905 | . . . . . . . . 9 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝑃 ∈ 𝑧) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑧) |
7 | sstr 3929 | . . . . . . . . 9 ⊢ ((∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑧 ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦) | |
8 | 6, 7 | sylan 580 | . . . . . . . 8 ⊢ (((𝑧 ∈ 𝐵 ∧ 𝑃 ∈ 𝑧) ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦) |
9 | 8 | expl 458 | . . . . . . 7 ⊢ (𝑧 ∈ 𝐵 → ((𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)) |
10 | 9 | rexlimiv 3209 | . . . . . 6 ⊢ (∃𝑧 ∈ 𝐵 (𝑃 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦) |
11 | 4, 10 | syl 17 | . . . . 5 ⊢ ((𝐴Fne𝐵 ∧ (𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦)) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦) |
12 | 11 | ex 413 | . . . 4 ⊢ (𝐴Fne𝐵 → ((𝑦 ∈ 𝐴 ∧ 𝑃 ∈ 𝑦) → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)) |
13 | 2, 12 | syl5bi 241 | . . 3 ⊢ (𝐴Fne𝐵 → (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥} → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦)) |
14 | 13 | ralrimiv 3102 | . 2 ⊢ (𝐴Fne𝐵 → ∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥}∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦) |
15 | ssint 4895 | . 2 ⊢ (∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ ∩ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥} ↔ ∀𝑦 ∈ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥}∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ 𝑦) | |
16 | 14, 15 | sylibr 233 | 1 ⊢ (𝐴Fne𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝑃 ∈ 𝑥} ⊆ ∩ {𝑥 ∈ 𝐴 ∣ 𝑃 ∈ 𝑥}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2106 ∀wral 3064 ∃wrex 3065 {crab 3068 ⊆ wss 3887 ∩ cint 4879 class class class wbr 5074 Fnecfne 34525 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-iota 6391 df-fun 6435 df-fv 6441 df-topgen 17154 df-fne 34526 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |