Theorem disjeq1 5113

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

Assertion

Ref	Expression
disjeq1	⊢ (𝐴 = 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem disjeq1

Step	Hyp	Ref	Expression
1		eqimss2 4036	. . 3 ⊢ (𝐴 = 𝐵 → 𝐵 ⊆ 𝐴)
2		disjss1 5112	. . 3 ⊢ (𝐵 ⊆ 𝐴 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐵 𝐶))
3	1, 2	syl 17	. 2 ⊢ (𝐴 = 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐵 𝐶))
4		eqimss 4035	. . 3 ⊢ (𝐴 = 𝐵 → 𝐴 ⊆ 𝐵)
5		disjss1 5112	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶))
6	4, 5	syl 17	. 2 ⊢ (𝐴 = 𝐵 → (Disj 𝑥 ∈ 𝐵 𝐶 → Disj 𝑥 ∈ 𝐴 𝐶))
7	3, 6	impbid 211	1 ⊢ (𝐴 = 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐶 ↔ Disj 𝑥 ∈ 𝐵 𝐶))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1533   ⊆ wss 3943  Disj wdisj 5106

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697

This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1536  df-ex 1774  df-sb 2060  df-mo 2528  df-clab 2704  df-cleq 2718  df-clel 2804  df-rmo 3370  df-v 3470  df-in 3950  df-ss 3960  df-disj 5107

This theorem is referenced by:  disjeq1d  5114  volfiniun  25431  disjrnmpt  32325  iundisj2cnt  32517  unelldsys  33686  sigapildsys  33690  ldgenpisyslem1  33691  rossros  33708  measvun  33737  pmeasmono  33853  pmeasadd  33854  meadjuni  45742