Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 0fz1 | Structured version Visualization version GIF version |
Description: Two ways to say a finite 1-based sequence is empty. (Contributed by Paul Chapman, 26-Oct-2012.) |
Ref | Expression |
---|---|
0fz1 | ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (1...𝑁)) → (𝐹 = ∅ ↔ 𝑁 = 0)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fn0 6487 | . . . . 5 ⊢ (𝐹 Fn ∅ ↔ 𝐹 = ∅) | |
2 | fndmu 6463 | . . . . 5 ⊢ ((𝐹 Fn (1...𝑁) ∧ 𝐹 Fn ∅) → (1...𝑁) = ∅) | |
3 | 1, 2 | sylan2br 598 | . . . 4 ⊢ ((𝐹 Fn (1...𝑁) ∧ 𝐹 = ∅) → (1...𝑁) = ∅) |
4 | 3 | ex 416 | . . 3 ⊢ (𝐹 Fn (1...𝑁) → (𝐹 = ∅ → (1...𝑁) = ∅)) |
5 | fneq2 6449 | . . . . 5 ⊢ ((1...𝑁) = ∅ → (𝐹 Fn (1...𝑁) ↔ 𝐹 Fn ∅)) | |
6 | 5, 1 | bitrdi 290 | . . . 4 ⊢ ((1...𝑁) = ∅ → (𝐹 Fn (1...𝑁) ↔ 𝐹 = ∅)) |
7 | 6 | biimpcd 252 | . . 3 ⊢ (𝐹 Fn (1...𝑁) → ((1...𝑁) = ∅ → 𝐹 = ∅)) |
8 | 4, 7 | impbid 215 | . 2 ⊢ (𝐹 Fn (1...𝑁) → (𝐹 = ∅ ↔ (1...𝑁) = ∅)) |
9 | fz1n 13095 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((1...𝑁) = ∅ ↔ 𝑁 = 0)) | |
10 | 8, 9 | sylan9bbr 514 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (1...𝑁)) → (𝐹 = ∅ ↔ 𝑁 = 0)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2112 ∅c0 4223 Fn wfn 6353 (class class class)co 7191 0cc0 10694 1c1 10695 ℕ0cn0 12055 ...cfz 13060 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-cnex 10750 ax-resscn 10751 ax-1cn 10752 ax-icn 10753 ax-addcl 10754 ax-addrcl 10755 ax-mulcl 10756 ax-mulrcl 10757 ax-mulcom 10758 ax-addass 10759 ax-mulass 10760 ax-distr 10761 ax-i2m1 10762 ax-1ne0 10763 ax-1rid 10764 ax-rnegex 10765 ax-rrecex 10766 ax-cnre 10767 ax-pre-lttri 10768 ax-pre-lttrn 10769 ax-pre-ltadd 10770 ax-pre-mulgt0 10771 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-nel 3037 df-ral 3056 df-rex 3057 df-reu 3058 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-tr 5147 df-id 5440 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-we 5496 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6140 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7148 df-ov 7194 df-oprab 7195 df-mpo 7196 df-om 7623 df-1st 7739 df-2nd 7740 df-wrecs 8025 df-recs 8086 df-rdg 8124 df-er 8369 df-en 8605 df-dom 8606 df-sdom 8607 df-pnf 10834 df-mnf 10835 df-xr 10836 df-ltxr 10837 df-le 10838 df-sub 11029 df-neg 11030 df-nn 11796 df-n0 12056 df-z 12142 df-uz 12404 df-fz 13061 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |