Theorem sseqn 11279

Description: Two ways to express the subsets of a class of a given size. It might seem that {𝑥 ∈ 𝒫 𝐴 ∣ (♯‘𝑥) = 𝑁} would suffice, but that would require the converse of hashcl 11220 or something similar. Although each side of the equality would be well defined if we changed 𝑁 ∈ ℕ₀ to 𝑁 ∈ ℤ, they would give different results for the (degenerate) case of a negative size, as shown at ssenneg 11280 and sshashneg 11281. (Contributed by Jim Kingdon, 22-May-2026.)

Assertion

Ref	Expression
sseqn	⊢ (𝑁 ∈ ℕ0 → {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ≈ (1...𝑁)} = {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑁})

Distinct variable group:   𝑥,𝑁

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem sseqn

Step	Hyp	Ref	Expression
1		1zzd 9671	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → 1 ∈ ℤ)
2		simpll 531	. . . . . . . . 9 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → 𝑁 ∈ ℕ0)
3	2	nn0zd 9766	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → 𝑁 ∈ ℤ)
4	1, 3	fzfigd 10868	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → (1...𝑁) ∈ Fin)
5		enfii 7176	. . . . . . 7 ⊢ (((1...𝑁) ∈ Fin ∧ 𝑥 ≈ (1...𝑁)) → 𝑥 ∈ Fin)
6	4, 5	sylancom 424	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → 𝑥 ∈ Fin)
7		simpr 110	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → 𝑥 ≈ (1...𝑁))
8		hashen 11223	. . . . . . . . 9 ⊢ ((𝑥 ∈ Fin ∧ (1...𝑁) ∈ Fin) → ((♯‘𝑥) = (♯‘(1...𝑁)) ↔ 𝑥 ≈ (1...𝑁)))
9	6, 4, 8	syl2anc 415	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → ((♯‘𝑥) = (♯‘(1...𝑁)) ↔ 𝑥 ≈ (1...𝑁)))
10	7, 9	mpbird 167	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → (♯‘𝑥) = (♯‘(1...𝑁)))
11		hashfz1 11222	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → (♯‘(1...𝑁)) = 𝑁)
12	2, 11	syl 14	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → (♯‘(1...𝑁)) = 𝑁)
13	10, 12	eqtrd 2271	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → (♯‘𝑥) = 𝑁)
14	6, 13	jca 306	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ 𝑥 ≈ (1...𝑁)) → (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁))
15		simprr 537	. . . . . . . 8 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)) → (♯‘𝑥) = 𝑁)
16	15	oveq2d 6101	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)) → (1...(♯‘𝑥)) = (1...𝑁))
17		isfinite4im 11231	. . . . . . . 8 ⊢ (𝑥 ∈ Fin → (1...(♯‘𝑥)) ≈ 𝑥)
18	17	ad2antrl 494	. . . . . . 7 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)) → (1...(♯‘𝑥)) ≈ 𝑥)
19	16, 18	eqbrtrrd 4154	. . . . . 6 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)) → (1...𝑁) ≈ 𝑥)
20	19	ensymd 7070	. . . . 5 ⊢ (((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)) → 𝑥 ≈ (1...𝑁))
21	14, 20	impbida 604	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑥 ∈ 𝒫 𝐴) → (𝑥 ≈ (1...𝑁) ↔ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)))
22	21	pm5.32da 456	. . 3 ⊢ (𝑁 ∈ ℕ0 → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ≈ (1...𝑁)) ↔ (𝑥 ∈ 𝒫 𝐴 ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁))))
23		elin 3412	. . . . 5 ⊢ (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ∈ Fin))
24	23	anbi1i 462	. . . 4 ⊢ ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ (♯‘𝑥) = 𝑁) ↔ ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ∈ Fin) ∧ (♯‘𝑥) = 𝑁))
25		anass 405	. . . 4 ⊢ (((𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ∈ Fin) ∧ (♯‘𝑥) = 𝑁) ↔ (𝑥 ∈ 𝒫 𝐴 ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)))
26	24, 25	bitri 184	. . 3 ⊢ ((𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ (♯‘𝑥) = 𝑁) ↔ (𝑥 ∈ 𝒫 𝐴 ∧ (𝑥 ∈ Fin ∧ (♯‘𝑥) = 𝑁)))
27	22, 26	bitr4di 198	. 2 ⊢ (𝑁 ∈ ℕ0 → ((𝑥 ∈ 𝒫 𝐴 ∧ 𝑥 ≈ (1...𝑁)) ↔ (𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∧ (♯‘𝑥) = 𝑁)))
28	27	rabbidva2 2805	1 ⊢ (𝑁 ∈ ℕ0 → {𝑥 ∈ 𝒫 𝐴 ∣ 𝑥 ≈ (1...𝑁)} = {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑁})

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  {crab 2532   ∩ cin 3219  𝒫 cpw 3688   class class class wbr 4130  ‘cfv 5377  (class class class)co 6085   ≈ cen 7020  Fincfn 7022  1c1 8180  ℕ₀cn0 9563  ...cfz 10411  ♯chash 11214

This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295

This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-fz 10412  df-ihash 11215

This theorem is used by: (None)