| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > disjxun0 | Structured version Visualization version GIF version | ||
| Description: Simplify a disjoint union. (Contributed by Thierry Arnoux, 27-Nov-2023.) |
| Ref | Expression |
|---|---|
| disjxun0.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 = ∅) |
| Ref | Expression |
|---|---|
| disjxun0 | ⊢ (𝜑 → (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | disjxun0.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝐶 = ∅) | |
| 2 | nel02 4288 | . . . . 5 ⊢ (𝐶 = ∅ → ¬ 𝑦 ∈ 𝐶) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ¬ 𝑦 ∈ 𝐶) |
| 4 | 3 | rmounid 33166 | . . 3 ⊢ (𝜑 → (∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶 ↔ ∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)) |
| 5 | 4 | albidv 1955 | . 2 ⊢ (𝜑 → (∀𝑦∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶)) |
| 6 | df-disj 5074 | . 2 ⊢ (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ ∀𝑦∃*𝑥 ∈ (𝐴 ∪ 𝐵)𝑦 ∈ 𝐶) | |
| 7 | df-disj 5074 | . 2 ⊢ (Disj 𝑥 ∈ 𝐴 𝐶 ↔ ∀𝑦∃*𝑥 ∈ 𝐴 𝑦 ∈ 𝐶) | |
| 8 | 5, 6, 7 | 3bitr4g 317 | 1 ⊢ (𝜑 → (Disj 𝑥 ∈ (𝐴 ∪ 𝐵)𝐶 ↔ Disj 𝑥 ∈ 𝐴 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 = wceq 1570 ∈ wcel 2147 ∃*wrmo 3368 ∪ cun 4152 ∅c0 4281 Disj wdisj 5073 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-mo 2567 df-clab 2742 df-cleq 2755 df-clel 2839 df-rmo 3369 df-v 3456 df-dif 4050 df-un 4154 df-nul 4282 df-disj 5074 |
| This theorem is used by: tocyccntz 33781 |
| Copyright terms: Public domain | W3C validator |