| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dfopg | GIF version | ||
| Description: Value of the ordered pair when the arguments are sets. (Contributed by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| dfopg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 2782 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 2 | elex 2782 | . 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
| 3 | df-3an 982 | . . . . . 6 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) | |
| 4 | 3 | baibr 921 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))) |
| 5 | 4 | abbidv 2322 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}) |
| 6 | abid2 2325 | . . . 4 ⊢ {𝑥 ∣ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {{𝐴}, {𝐴, 𝐵}} | |
| 7 | df-op 3641 | . . . . 5 ⊢ 〈𝐴, 𝐵〉 = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} | |
| 8 | 7 | eqcomi 2208 | . . . 4 ⊢ {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = 〈𝐴, 𝐵〉 |
| 9 | 5, 6, 8 | 3eqtr3g 2260 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} = 〈𝐴, 𝐵〉) |
| 10 | 9 | eqcomd 2210 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| 11 | 1, 2, 10 | syl2an 289 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1372 ∈ wcel 2175 {cab 2190 Vcvv 2771 {csn 3632 {cpr 3633 〈cop 3635 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-11 1528 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-v 2773 df-op 3641 |
| This theorem is referenced by: dfop 3817 opexg 4271 opth1 4279 opth 4280 0nelop 4291 op1stbg 4524 |
| Copyright terms: Public domain | W3C validator |