| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sshashneg | GIF version | ||
| Description: Subsets of a class of a negative size (a degenerate case). Together with ssenneg 11208 this shows that sseqn 11207 could not be extended beyond 𝑁 ∈ ℕ0. (Contributed by Jim Kingdon, 22-May-2026.) |
| Ref | Expression |
|---|---|
| sshashneg | ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 < 0) → {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑁} = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0red 8277 | . . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → 0 ∈ ℝ) | |
| 2 | simpr 110 | . . . . . . . 8 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) | |
| 3 | 2 | elin2d 3411 | . . . . . . 7 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑥 ∈ Fin) |
| 4 | hashcl 11148 | . . . . . . 7 ⊢ (𝑥 ∈ Fin → (♯‘𝑥) ∈ ℕ0) | |
| 5 | 3, 4 | syl 14 | . . . . . 6 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → (♯‘𝑥) ∈ ℕ0) |
| 6 | 5 | nn0red 9556 | . . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → (♯‘𝑥) ∈ ℝ) |
| 7 | 5 | nn0ge0d 9558 | . . . . 5 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → 0 ≤ (♯‘𝑥)) |
| 8 | 1, 6, 7 | lensymd 8397 | . . . 4 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → ¬ (♯‘𝑥) < 0) |
| 9 | simpr 110 | . . . . 5 ⊢ ((((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) ∧ (♯‘𝑥) = 𝑁) → (♯‘𝑥) = 𝑁) | |
| 10 | simpllr 536 | . . . . 5 ⊢ ((((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) ∧ (♯‘𝑥) = 𝑁) → 𝑁 < 0) | |
| 11 | 9, 10 | eqbrtrd 4133 | . . . 4 ⊢ ((((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) ∧ (♯‘𝑥) = 𝑁) → (♯‘𝑥) < 0) |
| 12 | 8, 11 | mtand 671 | . . 3 ⊢ (((𝑁 ∈ ℤ ∧ 𝑁 < 0) ∧ 𝑥 ∈ (𝒫 𝐴 ∩ Fin)) → ¬ (♯‘𝑥) = 𝑁) |
| 13 | 12 | ralrimiva 2617 | . 2 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 < 0) → ∀𝑥 ∈ (𝒫 𝐴 ∩ Fin) ¬ (♯‘𝑥) = 𝑁) |
| 14 | rabeq0 3540 | . 2 ⊢ ({𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑁} = ∅ ↔ ∀𝑥 ∈ (𝒫 𝐴 ∩ Fin) ¬ (♯‘𝑥) = 𝑁) | |
| 15 | 13, 14 | sylibr 134 | 1 ⊢ ((𝑁 ∈ ℤ ∧ 𝑁 < 0) → {𝑥 ∈ (𝒫 𝐴 ∩ Fin) ∣ (♯‘𝑥) = 𝑁} = ∅) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 ∀wral 2522 {crab 2526 ∩ cin 3212 ∅c0 3510 𝒫 cpw 3671 class class class wbr 4111 ‘cfv 5354 Fincfn 6977 0cc0 8129 < clt 8310 ℕ0cn0 9498 ℤcz 9579 ♯chash 11142 |
| 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-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-addcom 8229 ax-addass 8231 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-0id 8237 ax-rnegex 8238 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-ltadd 8245 |
| This theorem depends on definitions: df-bi 117 df-dc 843 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 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-recs 6538 df-frec 6624 df-er 6769 df-en 6978 df-dom 6979 df-fin 6980 df-pnf 8312 df-mnf 8313 df-xr 8314 df-ltxr 8315 df-le 8316 df-sub 8448 df-neg 8449 df-inn 9240 df-n0 9499 df-z 9580 df-uz 9857 df-ihash 11143 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |