Theorem nfdisjw 5082

Description: Bound-variable hypothesis builder for disjoint collection. Version of nfdisj 5083 with a disjoint variable condition, which does not require ax-13 2402. (Contributed by Mario Carneiro, 14-Nov-2016.) Avoid ax-13 2402. (Revised by GG, 26-Jan-2024.)

Hypotheses

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

Assertion

Ref	Expression
nfdisjw	⊢ Ⅎ𝑦Disj 𝑥 ∈ 𝐴 𝐵

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑥, 𝑦)

Proof of Theorem nfdisjw

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfdisj2 5072	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵))
2		nftru 1837	. . . . 5 ⊢ Ⅎ𝑥⊤
3		nfdisjw.1	. . . . . . . 8 ⊢ Ⅎ𝑦𝐴
4	3	a1i 11	. . . . . . 7 ⊢ (⊤ → Ⅎ𝑦𝐴)
5	4	nfcrd 2917	. . . . . 6 ⊢ (⊤ → Ⅎ𝑦 𝑥 ∈ 𝐴)
6		nfdisjw.2	. . . . . . . 8 ⊢ Ⅎ𝑦𝐵
7	6	nfcri 2915	. . . . . . 7 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
8	7	a1i 11	. . . . . 6 ⊢ (⊤ → Ⅎ𝑦 𝑧 ∈ 𝐵)
9	5, 8	nfand 1930	. . . . 5 ⊢ (⊤ → Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵))
10	2, 9	nfmodv 2585	. . . 4 ⊢ (⊤ → Ⅎ𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵))
11	10	mptru 1577	. . 3 ⊢ Ⅎ𝑦∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)
12	11	nfal 2354	. 2 ⊢ Ⅎ𝑦∀𝑧∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)
13	1, 12	nfxfr 1886	1 ⊢ Ⅎ𝑦Disj 𝑥 ∈ 𝐴 𝐵

This proof depends on syntax axioms:   ∧ wa 401  ∀wal 1568  ⊤wtru 1571  Ⅎwnf 1816   ∈ wcel 2145  ∃*wmo 2563  Ⅎwnfc 2908  Disj wdisj 5070

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-10 2178  ax-11 2194  ax-12 2213

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-mo 2565  df-clel 2836  df-nfc 2910  df-rmo 3366  df-disj 5071

This theorem is used by:  disjxiun  5100