Theorem cbvdisj 5083

Description: Change bound variables in a disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)

Hypotheses

Ref	Expression
cbvdisj.1	⊢ Ⅎ𝑦𝐵
cbvdisj.2	⊢ Ⅎ𝑥𝐶
cbvdisj.3	⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)

Assertion

Ref	Expression
cbvdisj	⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶)

Distinct variable group:   𝑥,𝑦,𝐴

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

Proof of Theorem cbvdisj

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvdisj.1	. . . . 5 ⊢ Ⅎ𝑦𝐵
2	1	nfcri 2918	. . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
3		cbvdisj.2	. . . . 5 ⊢ Ⅎ𝑥𝐶
4	3	nfcri 2918	. . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶
5		cbvdisj.3	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)
6	5	eleq2d 2850	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶))
7	2, 4, 6	cbvrmow 3394	. . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶)
8	7	albii 1852	. 2 ⊢ (∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶)
9		df-disj 5074	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ ∀𝑧∃*𝑥 ∈ 𝐴 𝑧 ∈ 𝐵)
10		df-disj 5074	. 2 ⊢ (Disj 𝑦 ∈ 𝐴 𝐶 ↔ ∀𝑧∃*𝑦 ∈ 𝐴 𝑧 ∈ 𝐶)
11	8, 9, 10	3bitr4i 306	1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑦 ∈ 𝐴 𝐶)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  ∃*wrmo 3368  Disj wdisj 5073

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-11 2197  ax-12 2216  ax-ext 2735

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 2567  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rmo 3369  df-disj 5074

This theorem is used by:  disjors  5089  disjxiun  5103  volfiniun  25912  voliun  25919  carsggect  35054  omsmeas  35059  disjf1  46465  disjrnmpt2  46470  fsumiunss  46854  sge0iunmpt  47695  iundjiun  47737  meadjiun  47743