| 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 3124 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
| 3 | disjeq2 5060 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) | |
| 4 | 2, 3 | syl 17 | 1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ∀wral 3047 Disj wdisj 5056 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-mo 2535 df-cleq 2723 df-clel 2806 df-ral 3048 df-rmo 3346 df-ss 3914 df-disj 5057 |
| This theorem is referenced by: disjeq12d 5065 iunmbl 25481 uniioovol 25507 tocyccntz 33113 carsggect 34331 disjeq12dv 36259 voliunnfl 37703 nnfoctbdjlem 46552 meadjiun 46563 |
| Copyright terms: Public domain | W3C validator |