| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fmfnfmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for fmfnfm 23845. (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 23724 | . . . . 5 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) | |
| 3 | 1, 2 | sylan 580 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) |
| 4 | sstr2 3953 | . . . . . 6 ⊢ ((𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝐹 “ 𝑤) ⊆ 𝑡)) | |
| 5 | imass2 6073 | . . . . . 6 ⊢ (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠)) | |
| 6 | 4, 5 | syl11 33 | . . . . 5 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑤 ⊆ 𝑠 → (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 7 | 6 | reximdv 3148 | . . . 4 ⊢ ((𝐹 “ 𝑠) ⊆ 𝑡 → (∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 8 | 3, 7 | syl5com 31 | . . 3 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ((𝐹 “ 𝑠) ⊆ 𝑡 → ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡)) |
| 9 | fmfnfm.l | . . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋)) | |
| 10 | filtop 23742 | . . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐿) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐿) |
| 12 | fmfnfm.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋) | |
| 13 | elfm 23834 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐿 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) | |
| 14 | 11, 1, 12, 13 | syl3anc 1373 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) |
| 15 | fmfnfm.fm | . . . . . . 7 ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿) | |
| 16 | 15 | sseld 3945 | . . . . . 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 2109 ∃wrex 3053 ⊆ wss 3914 “ cima 5641 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 ficfi 9361 fBascfbas 21252 Filcfil 23732 FilMap cfm 23820 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1o 8434 df-2o 8435 df-en 8919 df-fin 8922 df-fi 9362 df-fbas 21261 df-fg 21262 df-fil 23733 df-fm 23825 |
| This theorem is referenced by: fmfnfmlem4 23844 |
| Copyright terms: Public domain | W3C validator |