| 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 4882 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∪ cun 4149 {cpr 4586 ∪ cuni 4866 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-un 4151 df-sn 4585 df-pr 4587 df-uni 4867 |
| This theorem is used by: uniintsn 4944 uniop 5487 nlim2 8502 rankxplim 9900 mrcun 17802 indistps 23335 indistps2 23336 leordtval2 23536 ex-uni 31033 mnuprdlem1 45350 mnuprdlem2 45351 mnurndlem1 45359 fouriersw 47335 |
| Copyright terms: Public domain | W3C validator |