Theorem nfiung 4989

Description: Bound-variable hypothesis builder for indexed union. Usage of this theorem is discouraged because it depends on ax-13 2403. See nfiun 4987 for a version with more disjoint variable conditions, but not requiring ax-13 2403. (Contributed by Mario Carneiro, 25-Jan-2014.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nfiung.1	⊢ Ⅎ𝑦𝐴
nfiung.2	⊢ Ⅎ𝑦𝐵

Assertion

Ref	Expression
nfiung	⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵

Proof of Theorem nfiung

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-iun 4957	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
2		nfiung.1	. . . 4 ⊢ Ⅎ𝑦𝐴
3		nfiung.2	. . . . 5 ⊢ Ⅎ𝑦𝐵
4	3	nfcri 2916	. . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
5	2, 4	nfrex 3363	. . 3 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵
6	5	nfabg 2931	. 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
7	1, 6	nfcxfr 2922	1 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵

This proof depends on syntax axioms:   ∈ wcel 2142  {cab 2740  Ⅎwnfc 2909  ∃wrex 3088  ∪ ciun 4955

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-13 2403  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1572  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-iun 4957

This theorem is used by: (None)