| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfopg | Structured version Visualization version GIF version | ||
| Description: Value of the ordered pair when the arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.) (Avoid depending on this detail.) |
| Ref | Expression |
|---|---|
| dfopg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3471 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | elex 3471 | . 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
| 3 | dfopif 4836 | . . 3 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
| 4 | iftrue 4487 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) = {{𝐴}, {𝐴, 𝐵}}) | |
| 5 | 3, 4 | eqtrid 2807 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| 6 | 1, 2, 5 | syl2an 608 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 Vcvv 3450 ∅c0 4277 ifcif 4481 {csn 4584 {cpr 4586 〈cop 4834 |
| 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-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-ss 3897 df-dif 4046 df-nul 4278 df-if 4482 df-op 4835 |
| This theorem is used by: dfop 4838 opidg 4851 elopg 5435 opnz 5442 opth1 5444 opth 5445 0nelop 5468 opeqsng 5475 opwf 9827 rankopb 9873 wunop 10814 tskop 10863 gruop 10897 |
| Copyright terms: Public domain | W3C validator |