| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fmfnfmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for fmfnfm 23939. (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 23818 | . . . . 5 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) | |
| 3 | 1, 2 | sylan 581 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) |
| 4 | sstr2 3929 | . . . . . 6 ⊢ ((𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝐹 “ 𝑤) ⊆ 𝑡)) | |
| 5 | imass2 6065 | . . . . . 6 ⊢ (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠)) | |
| 6 | 4, 5 | syl11 33 | . . . . 5 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 7 | 6 | reximdv 3153 | . . . 4 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 8 | 3, 7 | syl5com 31 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ((𝐹 “ 𝑠) ⊆ 𝑡 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 9 | fmfnfm.l | . . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋)) | |
| 10 | filtop 23836 | . . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐿) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐿) |
| 12 | fmfnfm.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋) | |
| 13 | elfm 23928 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐿 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) | |
| 14 | 11, 1, 12, 13 | syl3anc 1374 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) |
| 15 | fmfnfm.fm | . . . . . . 7 ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿) | |
| 16 | 15 | sseld 3921 | . . . . . 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 3062 ⊆ wss 3890 “ cima 5631 ⟶wf 6492 ‘cfv 6496 (class class class)co 7364 ficfi 9320 fBascfbas 21338 Filcfil 23826 FilMap cfm 23914 |
| 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 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5306 ax-pr 5374 ax-un 7686 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5523 df-eprel 5528 df-po 5536 df-so 5537 df-fr 5581 df-we 5583 df-xp 5634 df-rel 5635 df-cnv 5636 df-co 5637 df-dm 5638 df-rn 5639 df-res 5640 df-ima 5641 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-ov 7367 df-oprab 7368 df-mpo 7369 df-om 7815 df-1o 8402 df-2o 8403 df-en 8891 df-fin 8894 df-fi 9321 df-fbas 21347 df-fg 21348 df-fil 23827 df-fm 23919 |
| This theorem is referenced by: fmfnfmlem4 23938 |
| Copyright terms: Public domain | W3C validator |