Metamath Proof Explorer


Theorem nfiundg

Description: Bound-variable hypothesis builder for indexed union. Usage of this theorem is discouraged because it depends on ax-13 , see nfiund for a weaker version that does not require it. (Contributed by Emmett Weisz, 6-Dec-2019) (New usage is discouraged.)

Ref Expression
Hypotheses nfiundg.1 ⊢ Ⅎ x φ
nfiundg.2 ⊢ φ → Ⅎ _ y A
nfiundg.3 ⊢ φ → Ⅎ _ y B
Assertion nfiundg ⊢ φ → Ⅎ _ y ⋃ x ∈ A B

Proof

Step Hyp Ref Expression
1 nfiundg.1 ⊢ Ⅎ x φ
2 nfiundg.2 ⊢ φ → Ⅎ _ y A
3 nfiundg.3 ⊢ φ → Ⅎ _ y B
4 df-iun ⊢ ⋃ x ∈ A B = z | ∃ x ∈ A z ∈ B
5 nfv ⊢ Ⅎ z φ
6 3 nfcrd ⊢ φ → Ⅎ y z ∈ B
7 1 2 6 nfrexd ⊢ φ → Ⅎ y ∃ x ∈ A z ∈ B
8 5 7 nfabd ⊢ φ → Ⅎ _ y z | ∃ x ∈ A z ∈ B
9 4 8 nfcxfrd ⊢ φ → Ⅎ _ y ⋃ x ∈ A B