| 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 2343 | . . 3 ⊢ ([𝑦 / 𝑥](𝜑 ∨ 𝜓) ↔ ([𝑦 / 𝑥]𝜑 ∨ [𝑦 / 𝑥]𝜓)) | |
| 2 | df-clab 2744 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∣ (𝜑 ∨ 𝜓)} ↔ [𝑦 / 𝑥](𝜑 ∨ 𝜓)) | |
| 3 | df-clab 2744 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
| 4 | df-clab 2744 | . . . 4 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜓} ↔ [𝑦 / 𝑥]𝜓) | |
| 5 | 3, 4 | orbi12i 928 | . . 3 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∨ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ ([𝑦 / 𝑥]𝜑 ∨ [𝑦 / 𝑥]𝜓)) |
| 6 | 1, 2, 5 | 3bitr4ri 307 | . 2 ⊢ ((𝑦 ∈ {𝑥 ∣ 𝜑} ∨ 𝑦 ∈ {𝑥 ∣ 𝜓}) ↔ 𝑦 ∈ {𝑥 ∣ (𝜑 ∨ 𝜓)}) |
| 7 | 6 | uneqri 4110 | 1 ⊢ ({𝑥 ∣ 𝜑} ∪ {𝑥 ∣ 𝜓}) = {𝑥 ∣ (𝜑 ∨ 𝜓)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∨ wo 861 = wceq 1570 [wsb 2099 ∈ wcel 2146 {cab 2743 ∪ cun 3904 |
| 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 2148 ax-9 2156 ax-10 2179 ax-12 2216 ax-ext 2737 |
| 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 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3911 |
| This theorem is used by: unrab 4268 rabun2 4277 hashf1lem2 14506 vdwlem6 17063 addsasslem1 28225 addsasslem2 28226 addsdilem1 28373 addsdilem2 28374 mulsasslem1 28385 mulsasslem2 28386 vtxdun 29860 satfvsuclem1 35864 satf0suclem 35880 fmlasuc0 35889 ecun 39075 sticksstones22 42968 diophun 43537 |
| Copyright terms: Public domain | W3C validator |