| 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 3475 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | elex 3475 | . 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
| 3 | dfopif 4842 | . . 3 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
| 4 | iftrue 4491 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) = {{𝐴}, {𝐴, 𝐵}}) | |
| 5 | 3, 4 | eqtrid 2810 | . 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 1570 ∈ wcel 2147 Vcvv 3454 ∅c0 4281 ifcif 4485 {csn 4588 {cpr 4590 〈cop 4840 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-v 3456 df-ss 3901 df-dif 4050 df-nul 4282 df-if 4486 df-op 4841 |
| This theorem is used by: dfop 4844 opidg 4857 elopg 5442 opnz 5449 opth1 5451 opth 5452 0nelop 5475 opeqsng 5482 opwf 9857 rankopb 9903 wunop 10846 tskop 10895 gruop 10929 |
| Copyright terms: Public domain | W3C validator |