Theorem nfiung 4984

Description: Bound-variable hypothesis builder for indexed union. Usage of this theorem is discouraged because it depends on ax-13 2401. See nfiun 4982 for a version with more disjoint variable conditions, but not requiring ax-13 2401. (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 4953	. 2 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
2		nfiung.1	. . . 4 ⊢ Ⅎ𝑦𝐴
3		nfiung.2	. . . . 5 ⊢ Ⅎ𝑦𝐵
4	3	nfcri 2914	. . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
5	2, 4	nfrex 3360	. . 3 ⊢ Ⅎ𝑦∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵
6	5	nfabg 2929	. 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 ∈ 𝐵}
7	1, 6	nfcxfr 2920	1 ⊢ Ⅎ𝑦∪ 𝑥 ∈ 𝐴 𝐵

This proof depends on syntax axioms:   ∈ wcel 2145  {cab 2738  Ⅎwnfc 2907  ∃wrex 3086  ∪ ciun 4951

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2401  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-iun 4953

This theorem is used by: (None)