| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unipr | Structured version Visualization version GIF version | ||
| Description: The union of a pair is the union of its members. Proposition 5.7 of [TakeutiZaring] p. 16. (Contributed by NM, 23-Aug-1993.) (Proof shortened by BJ, 1-Sep-2024.) |
| Ref | Expression |
|---|---|
| unipr.1 | ⊢ 𝐴 ∈ V |
| unipr.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| unipr | ⊢ ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unipr.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | unipr.2 | . 2 ⊢ 𝐵 ∈ V | |
| 3 | uniprg 4883 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 Vcvv 3451 ∪ cun 3897 {cpr 4586 ∪ cuni 4867 |
| 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-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3453 df-un 3904 df-sn 4585 df-pr 4587 df-uni 4868 |
| This theorem is used by: uniintsn 4945 uniop 5488 nlim2 8482 rankxplim 9877 mrcun 17776 indistps 23309 indistps2 23310 leordtval2 23510 ex-uni 31009 mnuprdlem1 45215 mnuprdlem2 45216 mnurndlem1 45224 fouriersw 47185 |
| Copyright terms: Public domain | W3C validator |