Theorem 0fz1 10399

Description: Two ways to say a finite 1-based sequence is empty. (Contributed by Paul Chapman, 26-Oct-2012.)

Assertion

Ref	Expression
0fz1	|- ( ( N e. NN0 /\ F Fn ( 1 ... N ) ) -> ( F = (/) <-> N = 0 ) )

Proof of Theorem 0fz1

Step	Hyp	Ref	Expression
1		fn0 5483	. . . . 5 |- ( F Fn (/) <-> F = (/) )
2		fndmu 5464	. . . . 5 |- ( ( F Fn ( 1 ... N ) /\ F Fn (/) ) -> ( 1 ... N ) = (/) )
3	1, 2	sylan2br 288	. . . 4 |- ( ( F Fn ( 1 ... N ) /\ F = (/) ) -> ( 1 ... N ) = (/) )
4	3	ex 115	. . 3 |- ( F Fn ( 1 ... N ) -> ( F = (/) -> ( 1 ... N ) = (/) ) )
5		fneq2 5450	. . . . 5 |- ( ( 1 ... N ) = (/) -> ( F Fn ( 1 ... N ) <-> F Fn (/) ) )
6	5, 1	bitrdi 196	. . . 4 |- ( ( 1 ... N ) = (/) -> ( F Fn ( 1 ... N ) <-> F = (/) ) )
7	6	biimpcd 159	. . 3 |- ( F Fn ( 1 ... N ) -> ( ( 1 ... N ) = (/) -> F = (/) ) )
8	4, 7	impbid 129	. 2 |- ( F Fn ( 1 ... N ) -> ( F = (/) <-> ( 1 ... N ) = (/) ) )
9		fz1n 10398	. 2 |- ( N e. NN0 -> ( ( 1 ... N ) = (/) <-> N = 0 ) )
10	8, 9	sylan9bbr 463	1 |- ( ( N e. NN0 /\ F Fn ( 1 ... N ) ) -> ( F = (/) <-> N = 0 ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1398   e. wcel 2205   (/)c0 3512   Fn wfn 5352  (class class class)co 6058   0cc0 8143   1c1 8144   NN0cn0 9513   ...cfz 10361

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-fz 10362

This theorem is referenced by: (None)