| 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 4893 | . 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 2146 Vcvv 3458 ∪ cun 3906 {cpr 4596 ∪ cuni 4877 |
| 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-ext 2738 |
| 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 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-un 3913 df-sn 4595 df-pr 4597 df-uni 4878 |
| This theorem is used by: uniintsn 4955 uniop 5503 nlim2 8484 rankxplim 9861 mrcun 17703 indistps 23205 indistps2 23206 leordtval2 23406 ex-uni 30814 mnuprdlem1 45023 mnuprdlem2 45024 mnurndlem1 45032 fouriersw 46986 |
| Copyright terms: Public domain | W3C validator |