| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unab | Structured version Visualization version GIF version | ||
| Description: Union of two class abstractions. (Contributed by NM, 29-Sep-2002.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) |
| Ref | Expression |
|---|---|
| unab | ⊢ ({𝑥 ∣ 𝜑} ∪ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∨ 𝜓)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbor 2340 | . . 3 ⊢ ([𝑦 / 𝑥](𝜑 ∨ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∨ [𝑦 / 𝑥]𝜓)) | |
| 2 | df-clab 2740 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ (𝜑 ∨ 𝜓)} ↔ [𝑦 / 𝑥](𝜑 ∨ 𝜓)) | |
| 3 | df-clab 2740 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 4 | df-clab 2740 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 5 | 3, 4 | orbi12i 928 | . . 3 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∨ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ ([𝑦 / 𝑥]𝜑 ∨ [𝑦 / 𝑥]𝜓)) |
| 6 | 1, 2, 5 | 3bitr4ri 307 | . 2 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∨ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ 𝑦 ∈ {𝑥 ∣ (𝜑 ∨ 𝜓)}) |
| 7 | 6 | uneqri 4103 | 1 ⊢ ({𝑥 ∣ 𝜑} ∪ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∨ 𝜓)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∨ wo 861 = wceq 1570 [wsb 2099 ∈ wcel 2145 {cab 2739 ∪ cun 3897 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-12 2213 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-un 3904 |
| This theorem is used by: unrab 4261 rabun2 4270 hashf1lem2 14594 vdwlem6 17157 addsasslem1 28382 addsasslem2 28383 addsdilem1 28530 addsdilem2 28531 mulsasslem1 28542 mulsasslem2 28543 vtxdun 30055 satfvsuclem1 36103 satf0suclem 36119 fmlasuc0 36128 dfproplem 38621 ecun 39305 sticksstones22 43198 diophun 43763 |
| Copyright terms: Public domain | W3C validator |