| 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 3478 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | elex 3478 | . 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
| 3 | dfopif 4837 | . . 3 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
| 4 | iftrue 4495 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) = {{𝐴}, {𝐴, 𝐵}}) | |
| 5 | 3, 4 | eqtrid 2812 | . 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 2146 Vcvv 3457 ∅c0 4286 ifcif 4489 {csn 4591 {cpr 4593 〈cop 4597 |
| 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 2737 |
| 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 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-dif 3909 df-ss 3923 df-nul 4287 df-if 4490 df-op 4598 |
| This theorem is used by: dfop 4839 opidg 4859 elopg 5450 opnz 5457 opth1 5459 opth 5460 0nelop 5481 opeqsng 5488 opwf 9791 rankopb 9831 wunop 10724 tskop 10773 gruop 10807 |
| Copyright terms: Public domain | W3C validator |