Theorem disjeq1d 5141

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

Hypothesis

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

Assertion

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

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

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

Proof of Theorem disjeq1d

Step	Hyp	Ref	Expression
1		disjeq1d.1	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
2		disjeq1 5140	. 2 ⊢ (𝐴 = 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))
3	1, 2	syl 17	1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))

Syntax hints:   → wi 4   ↔ wb 206   = wceq 1537  Disj wdisj 5133

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1778  df-mo 2543  df-cleq 2732  df-clel 2819  df-rmo 3388  df-ss 3993  df-disj 5134

This theorem is referenced by:  disjeq12d  5142  disjxiun  5163  disjdifprg  32597  disjdifprg2  32598  disjun0  32617  tocyccntz  33137  measxun2  34174  measssd  34179  meadjun  46383