| 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 3156 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
| 3 | disjeq2 5073 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) | |
| 4 | 2, 3 | syl 17 | 1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1562 ∈ wcel 2144 ∀wral 3078 Disj wdisj 5069 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1802 df-mo 2568 df-cleq 2756 df-clel 2839 df-ral 3079 df-rmo 3369 df-ss 3923 df-disj 5070 |
| This theorem is referenced by: disjeq12d 5078 iunmbl 25617 uniioovol 25643 tocyccntz 33326 carsggect 34617 disjeq12dv 36580 voliunnfl 38168 nnfoctbdjlem 47034 meadjiun 47045 |
| Copyright terms: Public domain | W3C validator |