ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sseqn Unicode version

Theorem sseqn 11262
Description: Two ways to express the subsets of a class of a given size. It might seem that  { x  e.  ~P A  |  ( `  x
)  =  N } would suffice, but that would require the converse of hashcl 11203 or something similar. Although each side of the equality would be well defined if we changed  N  e.  NN0 to  N  e.  ZZ, they would give different results for the (degenerate) case of a negative size, as shown at ssenneg 11263 and sshashneg 11264. (Contributed by Jim Kingdon, 22-May-2026.)
Assertion
Ref Expression
sseqn  |-  ( N  e.  NN0  ->  { x  e.  ~P A  |  x 
~~  ( 1 ... N ) }  =  { x  e.  ( ~P A  i^i  Fin )  |  ( `  x )  =  N } )
Distinct variable group:    x, N
Allowed substitution hint:    A( x)

Proof of Theorem sseqn
StepHypRef Expression
1 1zzd 9654 . . . . . . . 8  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  1  e.  ZZ )
2 simpll 531 . . . . . . . . 9  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  N  e.  NN0 )
32nn0zd 9749 . . . . . . . 8  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  N  e.  ZZ )
41, 3fzfigd 10851 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  (
1 ... N )  e. 
Fin )
5 enfii 7170 . . . . . . 7  |-  ( ( ( 1 ... N
)  e.  Fin  /\  x  ~~  ( 1 ... N ) )  ->  x  e.  Fin )
64, 5sylancom 424 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  x  e.  Fin )
7 simpr 110 . . . . . . . 8  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  x  ~~  ( 1 ... N
) )
8 hashen 11206 . . . . . . . . 9  |-  ( ( x  e.  Fin  /\  ( 1 ... N
)  e.  Fin )  ->  ( ( `  x
)  =  ( `  (
1 ... N ) )  <-> 
x  ~~  ( 1 ... N ) ) )
96, 4, 8syl2anc 415 . . . . . . . 8  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  (
( `  x )  =  ( `  ( 1 ... N ) )  <->  x  ~~  ( 1 ... N
) ) )
107, 9mpbird 167 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  ( `  x )  =  ( `  ( 1 ... N
) ) )
11 hashfz1 11205 . . . . . . . 8  |-  ( N  e.  NN0  ->  ( `  (
1 ... N ) )  =  N )
122, 11syl 14 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  ( `  ( 1 ... N
) )  =  N )
1310, 12eqtrd 2271 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  ( `  x )  =  N )
146, 13jca 306 . . . . 5  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  x  ~~  ( 1 ... N
) )  ->  (
x  e.  Fin  /\  ( `  x )  =  N ) )
15 simprr 537 . . . . . . . 8  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  ( x  e.  Fin  /\  ( `  x
)  =  N ) )  ->  ( `  x
)  =  N )
1615oveq2d 6095 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  ( x  e.  Fin  /\  ( `  x
)  =  N ) )  ->  ( 1 ... ( `  x
) )  =  ( 1 ... N ) )
17 isfinite4im 11214 . . . . . . . 8  |-  ( x  e.  Fin  ->  (
1 ... ( `  x
) )  ~~  x
)
1817ad2antrl 494 . . . . . . 7  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  ( x  e.  Fin  /\  ( `  x
)  =  N ) )  ->  ( 1 ... ( `  x
) )  ~~  x
)
1916, 18eqbrtrrd 4152 . . . . . 6  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  ( x  e.  Fin  /\  ( `  x
)  =  N ) )  ->  ( 1 ... N )  ~~  x )
2019ensymd 7064 . . . . 5  |-  ( ( ( N  e.  NN0  /\  x  e.  ~P A
)  /\  ( x  e.  Fin  /\  ( `  x
)  =  N ) )  ->  x  ~~  ( 1 ... N
) )
2114, 20impbida 604 . . . 4  |-  ( ( N  e.  NN0  /\  x  e.  ~P A
)  ->  ( x  ~~  ( 1 ... N
)  <->  ( x  e. 
Fin  /\  ( `  x
)  =  N ) ) )
2221pm5.32da 456 . . 3  |-  ( N  e.  NN0  ->  ( ( x  e.  ~P A  /\  x  ~~  ( 1 ... N ) )  <-> 
( x  e.  ~P A  /\  ( x  e. 
Fin  /\  ( `  x
)  =  N ) ) ) )
23 elin 3412 . . . . 5  |-  ( x  e.  ( ~P A  i^i  Fin )  <->  ( x  e.  ~P A  /\  x  e.  Fin ) )
2423anbi1i 462 . . . 4  |-  ( ( x  e.  ( ~P A  i^i  Fin )  /\  ( `  x )  =  N )  <->  ( (
x  e.  ~P A  /\  x  e.  Fin )  /\  ( `  x
)  =  N ) )
25 anass 405 . . . 4  |-  ( ( ( x  e.  ~P A  /\  x  e.  Fin )  /\  ( `  x
)  =  N )  <-> 
( x  e.  ~P A  /\  ( x  e. 
Fin  /\  ( `  x
)  =  N ) ) )
2624, 25bitri 184 . . 3  |-  ( ( x  e.  ( ~P A  i^i  Fin )  /\  ( `  x )  =  N )  <->  ( x  e.  ~P A  /\  (
x  e.  Fin  /\  ( `  x )  =  N ) ) )
2722, 26bitr4di 198 . 2  |-  ( N  e.  NN0  ->  ( ( x  e.  ~P A  /\  x  ~~  ( 1 ... N ) )  <-> 
( x  e.  ( ~P A  i^i  Fin )  /\  ( `  x
)  =  N ) ) )
2827rabbidva2 2805 1  |-  ( N  e.  NN0  ->  { x  e.  ~P A  |  x 
~~  ( 1 ... N ) }  =  { x  e.  ( ~P A  i^i  Fin )  |  ( `  x )  =  N } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {crab 2532    i^i cin 3219   ~Pcpw 3688   class class class wbr 4128   ` cfv 5375  (class class class)co 6079    ~~ cen 7014   Fincfn 7016   1c1 8174   NN0cn0 9546   ...cfz 10394  ♯chash 11197
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-addass 8275  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-0id 8281  ax-rnegex 8282  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-frec 6656  df-1o 6681  df-er 6801  df-en 7017  df-dom 7018  df-fin 7019  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-inn 9288  df-n0 9547  df-z 9628  df-uz 9905  df-fz 10395  df-ihash 11198
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator