Theorem disjeq2dv 5000

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

Hypothesis

Ref	Expression
disjeq2dv.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶)

Assertion

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

Distinct variable group:   𝜑,𝑥

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

Proof of Theorem disjeq2dv

Step	Hyp	Ref	Expression
1		disjeq2dv.1	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶)
2	1	ralrimiva 3149	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶)
3		disjeq2 4999	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶))
4	2, 3	syl 17	1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  Disj wdisj 4995

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2070  df-mo 2598  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-rmo 3114  df-v 3443  df-in 3888  df-ss 3898  df-disj 4996

This theorem is referenced by:  disjeq12d  5004  iunmbl  24157  uniioovol  24183  tocyccntz  30836  carsggect  31686  voliunnfl  35101  nnfoctbdjlem  43094  meadjiun  43105