Theorem disjeq12i 36733

Description: Equality theorem for disjoint collection. Inference version. (Contributed by GG, 1-Sep-2025.)

Hypotheses

Ref	Expression
disjeq12i.1	⊢ 𝐴 = 𝐵
disjeq12i.2	⊢ 𝐶 = 𝐷

Assertion

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

Proof of Theorem disjeq12i

Step	Hyp	Ref	Expression
1		disjeq2 5079	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 = 𝐷 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐷))
2		disjeq12i.2	. . . 4 ⊢ 𝐶 = 𝐷
3	2	a1i 11	. . 3 ⊢ (𝑥 ∈ 𝐴 → 𝐶 = 𝐷)
4	1, 3	mprg 3084	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐷)
5		disjeq12i.1	. . 3 ⊢ 𝐴 = 𝐵
6	5	disjeq1i 36732	. 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐷 ↔ Disj 𝑥 ∈ 𝐵 𝐷)
7	4, 6	bitri 278	1 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐷)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2142  Disj wdisj 5075

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

This proof depends on definitions:  df-bi 210  df-an 401  df-ex 1809  df-mo 2566  df-cleq 2754  df-clel 2837  df-ral 3079  df-rmo 3368  df-ss 3921  df-disj 5076

This theorem is used by: (None)