Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fz1f1o | Structured version Visualization version GIF version |
Description: A lemma for working with finite sums. (Contributed by Mario Carneiro, 22-Apr-2014.) |
Ref | Expression |
---|---|
fz1f1o | ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hashcl 13711 | . . . 4 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
2 | elnn0 11893 | . . . 4 ⊢ ((♯‘𝐴) ∈ ℕ0 ↔ ((♯‘𝐴) ∈ ℕ ∨ (♯‘𝐴) = 0)) | |
3 | 1, 2 | sylib 220 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) ∈ ℕ ∨ (♯‘𝐴) = 0)) |
4 | 3 | orcomd 867 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ∨ (♯‘𝐴) ∈ ℕ)) |
5 | hasheq0 13718 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) | |
6 | isfinite4 13717 | . . . . 5 ⊢ (𝐴 ∈ Fin ↔ (1...(♯‘𝐴)) ≈ 𝐴) | |
7 | bren 8512 | . . . . 5 ⊢ ((1...(♯‘𝐴)) ≈ 𝐴 ↔ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) | |
8 | 6, 7 | sylbb 221 | . . . 4 ⊢ (𝐴 ∈ Fin → ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) |
9 | 8 | biantrud 534 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) ∈ ℕ ↔ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) |
10 | 5, 9 | orbi12d 915 | . 2 ⊢ (𝐴 ∈ Fin → (((♯‘𝐴) = 0 ∨ (♯‘𝐴) ∈ ℕ) ↔ (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))) |
11 | 4, 10 | mpbid 234 | 1 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∨ wo 843 = wceq 1533 ∃wex 1776 ∈ wcel 2110 ∅c0 4291 class class class wbr 5059 –1-1-onto→wf1o 6349 ‘cfv 6350 (class class class)co 7150 ≈ cen 8500 Fincfn 8503 0cc0 10531 1c1 10532 ℕcn 11632 ℕ0cn0 11891 ...cfz 12886 ♯chash 13684 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-int 4870 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-card 9362 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-n0 11892 df-z 11976 df-uz 12238 df-fz 12887 df-hash 13685 |
This theorem is referenced by: sumz 15073 fsumf1o 15074 fsumss 15076 fsumcl2lem 15082 fsumadd 15090 fsummulc2 15133 fsumconst 15139 fsumrelem 15156 prod1 15292 fprodf1o 15294 fprodss 15296 fprodcl2lem 15298 fprodmul 15308 fproddiv 15309 fprodconst 15326 fprodn0 15327 gsumval3eu 19018 gsumzres 19023 gsumzcl2 19024 gsumzf1o 19026 gsumzaddlem 19035 gsumconst 19048 gsumzmhm 19051 gsumzoppg 19058 gsumfsum 20606 f1ocnt 30519 stoweidlem35 42313 stoweidlem39 42317 |
Copyright terms: Public domain | W3C validator |