| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fmfnfmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for fmfnfm 23944. (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 23823 | . . . . 5 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) | |
| 3 | 1, 2 | sylan 587 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) |
| 4 | sstr2 3923 | . . . . . 6 ⊢ ((𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝐹 “ 𝑤) ⊆ 𝑡)) | |
| 5 | imass2 6060 | . . . . . 6 ⊢ (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠)) | |
| 6 | 4, 5 | syl11 33 | . . . . 5 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 7 | 6 | reximdv 3156 | . . . 4 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 8 | 3, 7 | syl5com 31 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ((𝐹 “ 𝑠) ⊆ 𝑡 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 9 | fmfnfm.l | . . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋)) | |
| 10 | filtop 23841 | . . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐿) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐿) |
| 12 | fmfnfm.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋) | |
| 13 | elfm 23933 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐿 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) | |
| 14 | 11, 1, 12, 13 | syl3anc 1380 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) |
| 15 | fmfnfm.fm | . . . . . . 7 ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿) | |
| 16 | 15 | sseld 3915 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) → 𝑡 ∈ 𝐿)) |
| 17 | 14, 16 | sylbird 262 | . . . . 5 ⊢ (𝜑 → ((𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡) → 𝑡 ∈ 𝐿)) |
| 18 | 17 | expcomd 418 | . . . 4 ⊢ (𝜑 → (∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))) |
| 19 | 18 | adantr 482 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → (∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))) |
| 20 | 8, 19 | syld 47 | . 2 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))) |
| 21 | 20 | ex 414 | 1 ⊢ (𝜑 → (𝑠 ∈ (fi‘𝐵) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∈ wcel 2121 ∃wrex 3065 ⊆ wss 3884 “ cima 5623 ⟶wf 6484 ‘cfv 6488 (class class class)co 7359 ficfi 9317 fBascfbas 21338 Filcfil 23831 FilMap cfm 23919 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 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 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1o 8399 df-2o 8400 df-en 8888 df-fin 8891 df-fi 9318 df-fbas 21347 df-fg 21348 df-fil 23832 df-fm 23924 |
| This theorem is referenced by: fmfnfmlem4 23943 |
| Copyright terms: Public domain | W3C validator |