Theorem 1enumcard

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 does not depend on AC, but it is only meaningful for numerable sets. See 1enumen for a version that is meaningful for non-numerable sets, and see 1enum for a version that uses an explicit sum of complex number 1s.

(Contributed by BTernaryTau, 26-Jun-2026)

	Ref	Expression
Assertion	1enumcard	⊢ ( 𝐴 ∈ V → ( card ‘ 𝐴 ) = ( card ‘ ∪ 𝑥 ∈ 𝐴 ( { 𝑥 } × 1o ) ) )

Proof

Step	Hyp	Ref	Expression
1		1enumen	⊢ ( 𝐴 ∈ V → 𝐴 ≈ ∪ 𝑥 ∈ 𝐴 ( { 𝑥 } × 1o ) )
2		carden2b	⊢ ( 𝐴 ≈ ∪ 𝑥 ∈ 𝐴 ( { 𝑥 } × 1o ) → ( card ‘ 𝐴 ) = ( card ‘ ∪ 𝑥 ∈ 𝐴 ( { 𝑥 } × 1o ) ) )
3	1 2	syl	⊢ ( 𝐴 ∈ V → ( card ‘ 𝐴 ) = ( card ‘ ∪ 𝑥 ∈ 𝐴 ( { 𝑥 } × 1o ) ) )