# OCME · 知識與練習查找

302 MKO / 1,441 families / 360 batches / 36,000 questions.

36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training.

1 results; page 1/1.

## 第 5086 題：有限集合的完整冪集

- ID: `q-20261008-advance-20261011-r04-set-0086`; number: 5086
- Processing: second_context_reviewed
- MKO: [mko-set](/zh-Hant/mko/mko-set/)
- Family: [qf-density11-set-powerset-enumeration](/zh-Hant/explore/?family=qf-density11-set-powerset-enumeration)
- Batch: [batch-20261008-advance-20261011-r04-set-foundations](/zh-Hant/explore/?batch=batch-20261008-advance-20261011-r04-set-foundations)
- [Derivation](/zh-Hant/questions/q-20261008-advance-20261011-r04-set-0086/) / [Markdown](/zh-Hant/questions/q-20261008-advance-20261011-r04-set-0086/index.md) / [JSON](/data/question-derivations/questions/q-20261008-advance-20261011-r04-set-0086.json)