| 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 3459 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | elex 3459 | . 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
| 3 | dfopif 4824 | . . 3 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
| 4 | iftrue 4483 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) = {{𝐴}, {𝐴, 𝐵}}) | |
| 5 | 3, 4 | eqtrid 2781 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| 6 | 1, 2, 5 | syl2an 596 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3438 ∅c0 4283 ifcif 4477 {csn 4578 {cpr 4580 〈cop 4584 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-v 3440 df-dif 3902 df-ss 3916 df-nul 4284 df-if 4478 df-op 4585 |
| This theorem is referenced by: dfop 4826 opidg 4846 elopg 5412 opnz 5419 opth1 5421 opth 5422 0nelop 5442 opeqsng 5449 opwf 9722 rankopb 9762 wunop 10631 tskop 10680 gruop 10714 |
| Copyright terms: Public domain | W3C validator |