| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fmfnfmlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for fmfnfm 23904. (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 23783 | . . . . 5 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) | |
| 3 | 1, 2 | sylan 581 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 ∈ (fi‘𝐵)) → ∃𝑤 ∈ 𝐵 𝑤 ⊆ 𝑠) |
| 4 | sstr2 3939 | . . . . . 6 ⊢ ((𝐹 “ 𝑤) ⊆ (𝐹 “ 𝑠) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝐹 “ 𝑤) ⊆ 𝑡)) | |
| 5 | imass2 6060 | . . . . . 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 23801 | . . . . . . . 8 ⊢ (𝐿 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐿) | |
| 11 | 9, 10 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐿) |
| 12 | fmfnfm.f | . . . . . . 7 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋) | |
| 13 | elfm 23893 | . . . . . . 7 ⊢ ((𝑋 ∈ 𝐿 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) | |
| 14 | 11, 1, 12, 13 | syl3anc 1374 | . . . . . 6 ⊢ (𝜑 → (𝑡 ∈ ((𝑋 FilMap 𝐹)‘𝐵) ↔ (𝑡 ⊆ 𝑋 ∧ ∃𝑤 ∈ 𝐵 (𝐹 “ 𝑤) ⊆ 𝑡))) |
| 15 | fmfnfm.fm | . . . . . . 7 ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿) | |
| 16 | 15 | sseld 3931 | . . . . . 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 3900 “ cima 5626 ⟶wf 6487 ‘cfv 6491 (class class class)co 7358 ficfi 9315 fBascfbas 21299 Filcfil 23791 FilMap cfm 23879 |
| 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 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 |
| 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 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4902 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1o 8397 df-2o 8398 df-en 8886 df-fin 8889 df-fi 9316 df-fbas 21308 df-fg 21309 df-fil 23792 df-fm 23884 |
| This theorem is referenced by: fmfnfmlem4 23903 |
| Copyright terms: Public domain | W3C validator |