![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fsuppcolem | Structured version Visualization version GIF version |
Description: Lemma for fsuppco 8597. 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 5555 | . . . 4 ⊢ ◡(𝐹 ∘ 𝐺) = (◡𝐺 ∘ ◡𝐹) | |
2 | 1 | imaeq1i 5719 | . . 3 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) |
3 | imaco 5896 | . . 3 ⊢ ((◡𝐺 ∘ ◡𝐹) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) | |
4 | 2, 3 | eqtri 2802 | . 2 ⊢ (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) = (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) |
5 | fsuppcolem.g | . . . 4 ⊢ (𝜑 → 𝐺:𝑋–1-1→𝑌) | |
6 | df-f1 6142 | . . . . 5 ⊢ (𝐺:𝑋–1-1→𝑌 ↔ (𝐺:𝑋⟶𝑌 ∧ Fun ◡𝐺)) | |
7 | 6 | simprbi 492 | . . . 4 ⊢ (𝐺:𝑋–1-1→𝑌 → Fun ◡𝐺) |
8 | 5, 7 | syl 17 | . . 3 ⊢ (𝜑 → Fun ◡𝐺) |
9 | fsuppcolem.f | . . 3 ⊢ (𝜑 → (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) | |
10 | imafi 8549 | . . 3 ⊢ ((Fun ◡𝐺 ∧ (◡𝐹 “ (V ∖ {𝑍})) ∈ Fin) → (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) ∈ Fin) | |
11 | 8, 9, 10 | syl2anc 579 | . 2 ⊢ (𝜑 → (◡𝐺 “ (◡𝐹 “ (V ∖ {𝑍}))) ∈ Fin) |
12 | 4, 11 | syl5eqel 2863 | 1 ⊢ (𝜑 → (◡(𝐹 ∘ 𝐺) “ (V ∖ {𝑍})) ∈ Fin) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2107 Vcvv 3398 ∖ cdif 3789 {csn 4398 ◡ccnv 5356 “ cima 5360 ∘ ccom 5361 Fun wfun 6131 ⟶wf 6133 –1-1→wf1 6134 Fincfn 8243 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-8 2109 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-13 2334 ax-ext 2754 ax-sep 5019 ax-nul 5027 ax-pow 5079 ax-pr 5140 ax-un 7228 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3or 1072 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2551 df-eu 2587 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-reu 3097 df-rab 3099 df-v 3400 df-sbc 3653 df-dif 3795 df-un 3797 df-in 3799 df-ss 3806 df-pss 3808 df-nul 4142 df-if 4308 df-pw 4381 df-sn 4399 df-pr 4401 df-tp 4403 df-op 4405 df-uni 4674 df-br 4889 df-opab 4951 df-tr 4990 df-id 5263 df-eprel 5268 df-po 5276 df-so 5277 df-fr 5316 df-we 5318 df-xp 5363 df-rel 5364 df-cnv 5365 df-co 5366 df-dm 5367 df-rn 5368 df-res 5369 df-ima 5370 df-ord 5981 df-on 5982 df-lim 5983 df-suc 5984 df-iota 6101 df-fun 6139 df-fn 6140 df-f 6141 df-f1 6142 df-fo 6143 df-f1o 6144 df-fv 6145 df-om 7346 df-1o 7845 df-er 8028 df-en 8244 df-dom 8245 df-fin 8247 |
This theorem is referenced by: fsuppco 8597 |
Copyright terms: Public domain | W3C validator |