Theorem disjeq12d 5124

Description: Equality theorem for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.)

Hypotheses

Ref	Expression
disjeq1d.1	⊢ (𝜑 → 𝐴 = 𝐵)
disjeq12d.1	⊢ (𝜑 → 𝐶 = 𝐷)

Assertion

Ref	Expression
disjeq12d	⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐷))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥

Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑥)

Proof of Theorem disjeq12d

Step	Hyp	Ref	Expression
1		disjeq1d.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
2	1	disjeq1d 5123	. 2 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))
3		disjeq12d.1	. . . 4 ⊢ (𝜑 → 𝐶 = 𝐷)
4	3	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 = 𝐷)
5	4	disjeq2dv 5120	. 2 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐵 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐷))
6	2, 5	bitrd 279	1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐷))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1537   ∈ wcel 2106  Disj wdisj 5115

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1777  df-mo 2538  df-cleq 2727  df-clel 2814  df-ral 3060  df-rmo 3378  df-ss 3980  df-disj 5116

This theorem is referenced by: (None)