| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fsuppcolem | Structured version Visualization version GIF version | ||
| Description: Lemma for fsuppco 9361. 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 5875 | . . . 4 ⊢ ◡(𝐹 ∘ 𝐺) = (◡𝐺 ∘ ◡𝐹) | |
| 2 | 1 | imaeq1i 6059 | . . 3 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) |
| 3 | imaco 6252 | . . 3 ⊢ ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) | |
| 4 | 2, 3 | eqtri 2784 | . 2 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) |
| 5 | fsuppcolem.g | . . . 4 ⊢ (𝜑 → 𝐺:𝑋–1-1→𝑌) | |
| 6 | df-f1 6541 | . . . . 5 ⊢ (𝐺:𝑋–1-1→𝑌 ↔ (𝐺:𝑋⟶𝑌 ∧ Fun ◡𝐺)) | |
| 7 | 6 | simprbi 502 | . . . 4 ⊢ (𝐺:𝑋–1-1→𝑌 → Fun ◡𝐺) |
| 8 | 5, 7 | syl 18 | . . 3 ⊢ (𝜑 → Fun ◡𝐺) |
| 9 | fsuppcolem.f | . . 3 ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) | |
| 10 | imafi 9274 | . . 3 ⊢ ((Fun ◡𝐺 ∧ (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) → (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) ∈ Fin) | |
| 11 | 8, 9, 10 | syl2anc 595 | . 2 ⊢ (𝜑 → (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) ∈ Fin) |
| 12 | 4, 11 | eqeltrid 2865 | 1 ⊢ (𝜑 → (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) ∈ Fin) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2141 Vcvv 3453 ∖ cdif 3901 {csn 4588 ◡ccnv 5660 “ cima 5664 ∘ ccom 5665 Fun wfun 6530 ⟶wf 6532 –1-1→wf1 6533 Fincfn 8942 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5256 ax-nul 5268 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-om 7862 df-1o 8452 df-en 8943 df-dom 8944 df-fin 8946 |
| This theorem is referenced by: fsuppco 9361 |
| Copyright terms: Public domain | W3C validator |