Metamath Proof Explorer


Theorem acunirnmpt2

Description: Axiom of choice for the union of the range of a mapping to function. (Contributed by Thierry Arnoux, 7-Nov-2019) Remove dependency on ax-reg and ax-inf2 . (Revised by Timothy J. O'Malley, 15-Oct-2026)

Ref Expression
Hypotheses acunirnmpt.0 ⊢ φ → A ∈ V
acunirnmpt.1 ⊢ φ ∧ j ∈ A → B ≠ ∅
acunirnmpt2.2 ⊢ C = ⋃ ran ⁡ j ∈ A ⟼ B
acunirnmpt2.3 ⊢ j = f ⁡ x → B = D
Assertion acunirnmpt2 ⊢ φ → ∃ f f : C ⟶ A ∧ ∀ x ∈ C x ∈ D

Proof

Step Hyp Ref Expression
1 acunirnmpt.0 ⊢ φ → A ∈ V
2 acunirnmpt.1 ⊢ φ ∧ j ∈ A → B ≠ ∅
3 acunirnmpt2.2 ⊢ C = ⋃ ran ⁡ j ∈ A ⟼ B
4 acunirnmpt2.3 ⊢ j = f ⁡ x → B = D
5 mptexg ⊢ A ∈ V → j ∈ A ⟼ B ∈ V
6 rnexg ⊢ j ∈ A ⟼ B ∈ V → ran ⁡ j ∈ A ⟼ B ∈ V
7 uniexg ⊢ ran ⁡ j ∈ A ⟼ B ∈ V → ⋃ ran ⁡ j ∈ A ⟼ B ∈ V
8 1 5 6 7 4syl ⊢ φ → ⋃ ran ⁡ j ∈ A ⟼ B ∈ V
9 3 8 eqeltrid ⊢ φ → C ∈ V
10 eqid ⊢ j ∈ A ⟼ B = j ∈ A ⟼ B
11 simplr ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y → y ∈ ran ⁡ j ∈ A ⟼ B
12 10 11 elrnmpt2d ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y → ∃ j ∈ A y = B
13 nfv ⊢ Ⅎ j φ ∧ x ∈ C
14 nfmpt1 ⊢ Ⅎ _ j j ∈ A ⟼ B
15 14 nfrn ⊢ Ⅎ _ j ran ⁡ j ∈ A ⟼ B
16 15 nfcri ⊢ Ⅎ j y ∈ ran ⁡ j ∈ A ⟼ B
17 13 16 nfan ⊢ Ⅎ j φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B
18 nfv ⊢ Ⅎ j x ∈ y
19 17 18 nfan ⊢ Ⅎ j φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y
20 simpllr ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y ∧ j ∈ A ∧ y = B → x ∈ y
21 simpr ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y ∧ j ∈ A ∧ y = B → y = B
22 20 21 eleqtrd ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y ∧ j ∈ A ∧ y = B → x ∈ B
23 22 exp31 ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y → j ∈ A → y = B → x ∈ B
24 19 23 reximdai ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y → ∃ j ∈ A y = B → ∃ j ∈ A x ∈ B
25 12 24 mpd ⊢ φ ∧ x ∈ C ∧ y ∈ ran ⁡ j ∈ A ⟼ B ∧ x ∈ y → ∃ j ∈ A x ∈ B
26 3 eleq2i ⊢ x ∈ C ↔ x ∈ ⋃ ran ⁡ j ∈ A ⟼ B
27 eluni2 ⊢ x ∈ ⋃ ran ⁡ j ∈ A ⟼ B ↔ ∃ y ∈ ran ⁡ j ∈ A ⟼ B x ∈ y
28 26 27 sylbb ⊢ x ∈ C → ∃ y ∈ ran ⁡ j ∈ A ⟼ B x ∈ y
29 28 adantl ⊢ φ ∧ x ∈ C → ∃ y ∈ ran ⁡ j ∈ A ⟼ B x ∈ y
30 25 29 r19.29a ⊢ φ ∧ x ∈ C → ∃ j ∈ A x ∈ B
31 30 ralrimiva ⊢ φ → ∀ x ∈ C ∃ j ∈ A x ∈ B
32 4 eleq2d ⊢ j = f ⁡ x → x ∈ B ↔ x ∈ D
33 32 ac6 ⊢ C ∈ V ∧ A ∈ V ∧ ∀ x ∈ C ∃ j ∈ A x ∈ B → ∃ f f : C ⟶ A ∧ ∀ x ∈ C x ∈ D
34 9 1 31 33 syl3anc ⊢ φ → ∃ f f : C ⟶ A ∧ ∀ x ∈ C x ∈ D