Theorem cbvdisjvw2 37239

Description: Change bound variable and domain in a disjoint collection, using implicit substitution. (Contributed by GG, 14-Aug-2025.)

Hypotheses

Ref	Expression
cbvdisjvw2.1	⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷)
cbvdisjvw2.2	⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)

Assertion

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

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑥,𝐵   𝑦,𝐶   𝑥,𝐷

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑦)   𝐶(𝑥)   𝐷(𝑦)

Proof of Theorem cbvdisjvw2

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvdisjvw2.2	. . . 4 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
2		cbvdisjvw2.1	. . . . 5 ⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷)
3	2	eleq2d 2850	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑡 ∈ 𝐶 ↔ 𝑡 ∈ 𝐷))
4	1, 3	cbvrmovw2 37232	. . 3 ⊢ (∃*𝑥 ∈ 𝐴 𝑡 ∈ 𝐶 ↔ ∃*𝑦 ∈ 𝐵 𝑡 ∈ 𝐷)
5	4	albii 1852	. 2 ⊢ (∀𝑡∃*𝑥 ∈ 𝐴 𝑡 ∈ 𝐶 ↔ ∀𝑡∃*𝑦 ∈ 𝐵 𝑡 ∈ 𝐷)
6		df-disj 5076	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑡∃*𝑥 ∈ 𝐴 𝑡 ∈ 𝐶)
7		df-disj 5076	. 2 ⊢ (Disj 𝑦 ∈ 𝐵 𝐷 ↔ ∀𝑡∃*𝑦 ∈ 𝐵 𝑡 ∈ 𝐷)
8	5, 6, 7	3bitr4i 306	1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑦 ∈ 𝐵 𝐷)

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

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-mo 2567  df-cleq 2755  df-clel 2839  df-rmo 3369  df-disj 5076

This theorem is used by: (None)