Metamath Proof Explorer


Theorem 1enumen

Description: The Fundamental Theorem of Enumeration (see https://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimPDF/enu.pdf ), extended to all sets.

The expression U_ x e. A ( { x } X. B ) can be thought of as expressing an indexed disjoint union |_| x e. A B where each B has its elements tagged with the set x that generated it. See the comment directly before undjudom for context on disjoint union as a representation of cardinal addition.

This theorem is not limited to numerable sets, but it also does not depend on AC. See 1enumcard for a version that uses the cardinality function, and see 1enum for a version that uses an explicit sum of complex number 1s.

(Contributed by BTernaryTau, 26-Jun-2026)

Ref Expression
Assertion 1enumen A V A x A x × 1 𝑜

Proof

Step Hyp Ref Expression
1 xp1en A V A × 1 𝑜 A
2 1 ensymd A V A A × 1 𝑜
3 iunid x A x = A
4 3 xpeq1i x A x × 1 𝑜 = A × 1 𝑜
5 xpiundir x A x × 1 𝑜 = x A x × 1 𝑜
6 4 5 eqtr3i A × 1 𝑜 = x A x × 1 𝑜
7 2 6 breqtrdi A V A x A x × 1 𝑜