| 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 3164 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
| 3 | disjeq2 5085 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) | |
| 4 | 2, 3 | syl 18 | 1 ⊢ (𝜑 → (Disj 𝑥 ∈ 𝐴 𝐵 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2150 ∀wral 3086 Disj wdisj 5081 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1808 df-mo 2574 df-cleq 2762 df-clel 2845 df-ral 3087 df-rmo 3376 df-ss 3930 df-disj 5082 |
| This theorem is referenced by: disjeq12d 5090 iunmbl 25695 uniioovol 25721 tocyccntz 33434 carsggect 34678 disjeq12dv 36675 voliunnfl 38263 nnfoctbdjlem 47121 meadjiun 47132 |
| Copyright terms: Public domain | W3C validator |