| 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 6630 | . . . . 5 ⊢ (𝐹 Fn ∅ ↔ 𝐹 = ∅) | |
| 2 | fndmu 6606 | . . . . 5 ⊢ ((𝐹 Fn (1...𝑁) ∧ 𝐹 Fn ∅) → (1...𝑁) = ∅) | |
| 3 | 1, 2 | sylan2br 596 | . . . 4 ⊢ ((𝐹 Fn (1...𝑁) ∧ 𝐹 = ∅) → (1...𝑁) = ∅) |
| 4 | 3 | ex 412 | . . 3 ⊢ (𝐹 Fn (1...𝑁) → (𝐹 = ∅ → (1...𝑁) = ∅)) |
| 5 | fneq2 6591 | . . . . 5 ⊢ ((1...𝑁) = ∅ → (𝐹 Fn (1...𝑁) ↔ 𝐹 Fn ∅)) | |
| 6 | 5, 1 | bitrdi 287 | . . . 4 ⊢ ((1...𝑁) = ∅ → (𝐹 Fn (1...𝑁) ↔ 𝐹 = ∅)) |
| 7 | 6 | biimpcd 249 | . . 3 ⊢ (𝐹 Fn (1...𝑁) → ((1...𝑁) = ∅ → 𝐹 = ∅)) |
| 8 | 4, 7 | impbid 212 | . 2 ⊢ (𝐹 Fn (1...𝑁) → (𝐹 = ∅ ↔ (1...𝑁) = ∅)) |
| 9 | fz1n 13496 | . 2 ⊢ (𝑁 ∈ ℕ0 → ((1...𝑁) = ∅ ↔ 𝑁 = 0)) | |
| 10 | 8, 9 | sylan9bbr 510 | 1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐹 Fn (1...𝑁)) → (𝐹 = ∅ ↔ 𝑁 = 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∅c0 4274 Fn wfn 6494 (class class class)co 7367 0cc0 11038 1c1 11039 ℕ0cn0 12437 ...cfz 13461 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5308 ax-pr 5376 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6266 df-ord 6327 df-on 6328 df-lim 6329 df-suc 6330 df-iota 6455 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-fz 13462 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |