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 14069 | . . . 4 ⊢ (𝐴 ∈ Fin → (♯‘𝐴) ∈ ℕ0) | |
2 | elnn0 12235 | . . . 4 ⊢ ((♯‘𝐴) ∈ ℕ0 ↔ ((♯‘𝐴) ∈ ℕ ∨ (♯‘𝐴) = 0)) | |
3 | 1, 2 | sylib 217 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) ∈ ℕ ∨ (♯‘𝐴) = 0)) |
4 | 3 | orcomd 868 | . 2 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ∨ (♯‘𝐴) ∈ ℕ)) |
5 | hasheq0 14076 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) = 0 ↔ 𝐴 = ∅)) | |
6 | isfinite4 14075 | . . . . 5 ⊢ (𝐴 ∈ Fin ↔ (1...(♯‘𝐴)) ≈ 𝐴) | |
7 | bren 8726 | . . . . 5 ⊢ ((1...(♯‘𝐴)) ≈ 𝐴 ↔ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) | |
8 | 6, 7 | sylbb 218 | . . . 4 ⊢ (𝐴 ∈ Fin → ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴) |
9 | 8 | biantrud 532 | . . 3 ⊢ (𝐴 ∈ Fin → ((♯‘𝐴) ∈ ℕ ↔ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) |
10 | 5, 9 | orbi12d 916 | . 2 ⊢ (𝐴 ∈ Fin → (((♯‘𝐴) = 0 ∨ (♯‘𝐴) ∈ ℕ) ↔ (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴)))) |
11 | 4, 10 | mpbid 231 | 1 ⊢ (𝐴 ∈ Fin → (𝐴 = ∅ ∨ ((♯‘𝐴) ∈ ℕ ∧ ∃𝑓 𝑓:(1...(♯‘𝐴))–1-1-onto→𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∨ wo 844 = wceq 1542 ∃wex 1786 ∈ wcel 2110 ∅c0 4262 class class class wbr 5079 –1-1-onto→wf1o 6431 ‘cfv 6432 (class class class)co 7271 ≈ cen 8713 Fincfn 8716 0cc0 10872 1c1 10873 ℕcn 11973 ℕ0cn0 12233 ...cfz 13238 ♯chash 14042 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 ax-cnex 10928 ax-resscn 10929 ax-1cn 10930 ax-icn 10931 ax-addcl 10932 ax-addrcl 10933 ax-mulcl 10934 ax-mulrcl 10935 ax-mulcom 10936 ax-addass 10937 ax-mulass 10938 ax-distr 10939 ax-i2m1 10940 ax-1ne0 10941 ax-1rid 10942 ax-rnegex 10943 ax-rrecex 10944 ax-cnre 10945 ax-pre-lttri 10946 ax-pre-lttrn 10947 ax-pre-ltadd 10948 ax-pre-mulgt0 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ne 2946 df-nel 3052 df-ral 3071 df-rex 3072 df-reu 3073 df-rab 3075 df-v 3433 df-sbc 3721 df-csb 3838 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-pss 3911 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-int 4886 df-iun 4932 df-br 5080 df-opab 5142 df-mpt 5163 df-tr 5197 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6201 df-ord 6268 df-on 6269 df-lim 6270 df-suc 6271 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-f1 6437 df-fo 6438 df-f1o 6439 df-fv 6440 df-riota 7228 df-ov 7274 df-oprab 7275 df-mpo 7276 df-om 7707 df-1st 7824 df-2nd 7825 df-frecs 8088 df-wrecs 8119 df-recs 8193 df-rdg 8232 df-1o 8288 df-er 8481 df-en 8717 df-dom 8718 df-sdom 8719 df-fin 8720 df-card 9698 df-pnf 11012 df-mnf 11013 df-xr 11014 df-ltxr 11015 df-le 11016 df-sub 11207 df-neg 11208 df-nn 11974 df-n0 12234 df-z 12320 df-uz 12582 df-fz 13239 df-hash 14043 |
This theorem is referenced by: sumz 15432 fsumf1o 15433 fsumss 15435 fsumcl2lem 15441 fsumadd 15450 fsummulc2 15494 fsumconst 15500 fsumrelem 15517 prod1 15652 fprodf1o 15654 fprodss 15656 fprodcl2lem 15658 fprodmul 15668 fproddiv 15669 fprodconst 15686 fprodn0 15687 gsumval3eu 19503 gsumzres 19508 gsumzcl2 19509 gsumzf1o 19511 gsumzaddlem 19520 gsumconst 19533 gsumzmhm 19536 gsumzoppg 19543 gsumfsum 20663 f1ocnt 31119 stoweidlem35 43547 stoweidlem39 43551 |
Copyright terms: Public domain | W3C validator |