Theorem disjeq12d 5090

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 5089	. 2 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))
3		disjeq12d.1	. . . 4 ⊢ (𝜑 → 𝐶 = 𝐷)
4	3	adantr 485	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 = 𝐷)
5	4	disjeq2dv 5086	. 2 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐵 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐷))
6	2, 5	bitrd 282	1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐷))

Syntax hints:   → wi 4   ↔ wb 209   = wceq 1568   ∈ wcel 2150  Disj wdisj 5081

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2152  ax-9 2160  ax-ext 2742

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1808  df-mo 2574  df-cleq 2762  df-clel 2845  df-ral 3087  df-rmo 3376  df-ss 3930  df-disj 5082

This theorem is referenced by: (None)