![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > disjeq2dv | Structured version Visualization version GIF version |
Description: Equality deduction for disjoint collection. (Contributed by Mario Carneiro, 14-Nov-2016.) |
Ref | Expression |
---|---|
disjeq2dv.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
disjeq2dv | ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | disjeq2dv.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
2 | 1 | ralrimiva 3141 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
3 | disjeq2 5072 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) | |
4 | 2, 3 | syl 17 | 1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3062 Disj wdisj 5068 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-ex 1782 df-sb 2068 df-mo 2539 df-clab 2715 df-cleq 2729 df-clel 2815 df-ral 3063 df-rmo 3351 df-v 3445 df-in 3915 df-ss 3925 df-disj 5069 |
This theorem is referenced by: disjeq12d 5077 iunmbl 24868 uniioovol 24894 tocyccntz 31817 carsggect 32721 voliunnfl 36053 nnfoctbdjlem 44590 meadjiun 44601 |
Copyright terms: Public domain | W3C validator |