Metamath Proof Explorer


Theorem cardiun

Description: The indexed union of a set of cardinals is a cardinal. (Contributed by NM, 3-Nov-2003)

Ref Expression
Assertion cardiun ⊢ A ∈ V → ∀ x ∈ A card ⁡ B = B → card ⁡ ⋃ x ∈ A B = ⋃ x ∈ A B

Proof

Step Hyp Ref Expression
1 abrexexg ⊢ A ∈ V → z | ∃ x ∈ A z = card ⁡ B ∈ V
2 vex ⊢ y ∈ V
3 eqeq1 ⊢ z = y → z = card ⁡ B ↔ y = card ⁡ B
4 3 rexbidv ⊢ z = y → ∃ x ∈ A z = card ⁡ B ↔ ∃ x ∈ A y = card ⁡ B
5 2 4 elab ⊢ y ∈ z | ∃ x ∈ A z = card ⁡ B ↔ ∃ x ∈ A y = card ⁡ B
6 cardidm ⊢ card ⁡ card ⁡ B = card ⁡ B
7 fveq2 ⊢ y = card ⁡ B → card ⁡ y = card ⁡ card ⁡ B
8 id ⊢ y = card ⁡ B → y = card ⁡ B
9 6 7 8 3eqtr4a ⊢ y = card ⁡ B → card ⁡ y = y
10 9 rexlimivw ⊢ ∃ x ∈ A y = card ⁡ B → card ⁡ y = y
11 5 10 sylbi ⊢ y ∈ z | ∃ x ∈ A z = card ⁡ B → card ⁡ y = y
12 11 rgen ⊢ ∀ y ∈ z | ∃ x ∈ A z = card ⁡ B card ⁡ y = y
13 carduni ⊢ z | ∃ x ∈ A z = card ⁡ B ∈ V → ∀ y ∈ z | ∃ x ∈ A z = card ⁡ B card ⁡ y = y → card ⁡ ⋃ z | ∃ x ∈ A z = card ⁡ B = ⋃ z | ∃ x ∈ A z = card ⁡ B
14 1 12 13 mpisyl ⊢ A ∈ V → card ⁡ ⋃ z | ∃ x ∈ A z = card ⁡ B = ⋃ z | ∃ x ∈ A z = card ⁡ B
15 fvex ⊢ card ⁡ B ∈ V
16 15 dfiun2 ⊢ ⋃ x ∈ A card ⁡ B = ⋃ z | ∃ x ∈ A z = card ⁡ B
17 16 fveq2i ⊢ card ⁡ ⋃ x ∈ A card ⁡ B = card ⁡ ⋃ z | ∃ x ∈ A z = card ⁡ B
18 14 17 16 3eqtr4g ⊢ A ∈ V → card ⁡ ⋃ x ∈ A card ⁡ B = ⋃ x ∈ A card ⁡ B
19 18 adantr ⊢ A ∈ V ∧ ∀ x ∈ A card ⁡ B = B → card ⁡ ⋃ x ∈ A card ⁡ B = ⋃ x ∈ A card ⁡ B
20 iuneq2 ⊢ ∀ x ∈ A card ⁡ B = B → ⋃ x ∈ A card ⁡ B = ⋃ x ∈ A B
21 20 adantl ⊢ A ∈ V ∧ ∀ x ∈ A card ⁡ B = B → ⋃ x ∈ A card ⁡ B = ⋃ x ∈ A B
22 21 fveq2d ⊢ A ∈ V ∧ ∀ x ∈ A card ⁡ B = B → card ⁡ ⋃ x ∈ A card ⁡ B = card ⁡ ⋃ x ∈ A B
23 19 22 21 3eqtr3d ⊢ A ∈ V ∧ ∀ x ∈ A card ⁡ B = B → card ⁡ ⋃ x ∈ A B = ⋃ x ∈ A B
24 23 ex ⊢ A ∈ V → ∀ x ∈ A card ⁡ B = B → card ⁡ ⋃ x ∈ A B = ⋃ x ∈ A B