| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fmfnfmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for fmfnfm 23911. (Contributed by Jeff Hankins, 18-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.) |
| Ref | Expression |
|---|---|
| fmfnfm.b | ⊢ (𝜑 → 𝐵 ∈ (fBas‘𝑌)) |
| fmfnfm.l | ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋)) |
| fmfnfm.f | ⊢ (𝜑 → 𝐹:𝑌⟶𝑋) |
| fmfnfm.fm | ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿) |
| Ref | Expression |
|---|---|
| fmfnfmlem1 | ⊢ (𝜑 → (𝑠 ∈ (fi‘𝐵) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fmfnfm.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (fBas‘𝑌)) | |
| 2 | fbssfi 23790 | . . . . 5 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) | |
| 3 | 1, 2 | sylan 581 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) |
| 4 | sstr2 3924 | . . . . . 6 ⊢ ((𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝐹 “ 𝑤) ⊆ 𝑡)) | |
| 5 | imass2 6056 | . . . . . 6 ⊢ (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠)) | |
| 6 | 4, 5 | syl11 33 | . . . . 5 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 7 | 6 | reximdv 3150 | . . . 4 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 8 | 3, 7 | syl5com 31 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ((𝐹 “ 𝑠) ⊆ 𝑡 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 9 | fmfnfm.l | . . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋)) | |
| 10 | filtop 23808 | . . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐿) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐿) |
| 12 | fmfnfm.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋) | |
| 13 | elfm 23900 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐿 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) | |
| 14 | 11, 1, 12, 13 | syl3anc 1374 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) |
| 15 | fmfnfm.fm | . . . . . . 7 ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿) | |
| 16 | 15 | sseld 3916 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) → 𝑡 ∈ 𝐿)) |
| 17 | 14, 16 | sylbird 260 | . . . . 5 ⊢ (𝜑 → ((𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡) → 𝑡 ∈ 𝐿)) |
| 18 | 17 | expcomd 416 | . . . 4 ⊢ (𝜑 → (∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))) |
| 19 | 18 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → (∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))) |
| 20 | 8, 19 | syld 47 | . 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))) |
| 21 | 20 | ex 412 | 1 ⊢ (𝜑 → (𝑠 ∈ (fi‘𝐵) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 ∃wrex 3059 ⊆ wss 3885 “ cima 5623 ⟶wf 6483 ‘cfv 6487 (class class class)co 7356 ficfi 9312 fBascfbas 21329 Filcfil 23798 FilMap cfm 23886 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1o 8394 df-2o 8395 df-en 8883 df-fin 8886 df-fi 9313 df-fbas 21338 df-fg 21339 df-fil 23799 df-fm 23891 |
| This theorem is referenced by: fmfnfmlem4 23910 |
| Copyright terms: Public domain | W3C validator |