| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfop | Structured version Visualization version GIF version | ||
| Description: Value of an ordered pair when the arguments are sets, with the conclusion corresponding to Kuratowski's original definition. (Contributed by NM, 25-Jun-1998.) (Avoid depending on this detail.) |
| Ref | Expression |
|---|---|
| dfop.1 | ⊢ 𝐴 ∈ V |
| dfop.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| dfop | ⊢ 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfop.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | dfop.2 | . 2 ⊢ 𝐵 ∈ V | |
| 3 | dfopg 4843 | . 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 2147 Vcvv 3454 {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: opi1 5444 opi2 5445 op1stb 5447 opeqpr 5484 propssopi 5487 uniop 5495 xpsspw 5796 relop 5838 funopg 6602 |
| Copyright terms: Public domain | W3C validator |