Theorem disjeq2 5073

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

Assertion

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

Proof of Theorem disjeq2

Step	Hyp	Ref	Expression
1		eqimss2 3967	. . . 4 ⊢ (𝐵 = 𝐶 → 𝐶 ⊆ 𝐵)
2	1	ralimi 3099	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)
3		disjss2 5072	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐴 𝐶))
4	2, 3	syl 18	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 → Disj 𝑥 ∈ 𝐴 𝐶))
5		eqimss 3966	. . . 4 ⊢ (𝐵 = 𝐶 → 𝐵 ⊆ 𝐶)
6	5	ralimi 3099	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶)
7		disjss2 5072	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵))
8	6, 7	syl 18	. 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐶 → Disj 𝑥 ∈ 𝐴 𝐵))
9	4, 8	impbid 215	1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  ∀wral 3076   ⊆ wss 3895  Disj wdisj 5069

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-mo 2564  df-cleq 2752  df-clel 2835  df-ral 3077  df-rmo 3365  df-ss 3896  df-disj 5070

This theorem is used by:  disjeq2dv  5074  voliun  25875  carsgclctunlem2  34951  disjeq12i  36982  mblfinlem2  38577  voliunnfl  38583