| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsuppcolem | Structured version Visualization version GIF version | ||
| Description: Lemma for fsuppco 9360. Formula building theorem for finite supports: rearranging the index set. (Contributed by Stefan O'Rear, 21-Mar-2015.) |
| Ref | Expression |
|---|---|
| fsuppcolem.f | ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) |
| fsuppcolem.g | ⊢ (𝜑 → 𝐺:𝑋–1-1→𝑌) |
| Ref | Expression |
|---|---|
| fsuppcolem | ⊢ (𝜑 → (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) ∈ Fin) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnvco 5852 | . . . 4 ⊢ ◡(𝐹 ∘ 𝐺) = (◡𝐺 ∘ ◡𝐹) | |
| 2 | 1 | imaeq1i 6031 | . . 3 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) |
| 3 | imaco 6227 | . . 3 ⊢ ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) | |
| 4 | 2, 3 | eqtri 2753 | . 2 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) |
| 5 | fsuppcolem.g | . . . 4 ⊢ (𝜑 → 𝐺:𝑋–1-1→𝑌) | |
| 6 | df-f1 6519 | . . . . 5 ⊢ (𝐺:𝑋–1-1→𝑌 ↔ (𝐺:𝑋⟶𝑌 ∧ Fun ◡𝐺)) | |
| 7 | 6 | simprbi 496 | . . . 4 ⊢ (𝐺:𝑋–1-1→𝑌 → Fun ◡𝐺) |
| 8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → Fun ◡𝐺) |
| 9 | fsuppcolem.f | . . 3 ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) | |
| 10 | imafi 9271 | . . 3 ⊢ ((Fun ◡𝐺 ∧ (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) → (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) ∈ Fin) | |
| 11 | 8, 9, 10 | syl2anc 584 | . 2 ⊢ (𝜑 → (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) ∈ Fin) |
| 12 | 4, 11 | eqeltrid 2833 | 1 ⊢ (𝜑 → (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2109 Vcvv 3450 ∖ cdif 3914 {csn 4592 ◡ccnv 5640 “ cima 5644 ∘ ccom 5645 Fun wfun 6508 ⟶wf 6510 –1-1→wf1 6511 Fincfn 8921 |
| 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 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| 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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-om 7846 df-1o 8437 df-en 8922 df-dom 8923 df-fin 8925 |
| This theorem is referenced by: fsuppco 9360 |
| Copyright terms: Public domain | W3C validator |