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 2610 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
2 | elex 2610 | . 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
3 | df-3an 921 | . . . . . 6 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}) ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})) | |
4 | 3 | baibr 862 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}))) |
5 | 4 | abbidv 2196 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {𝑥 ∣ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})}) |
6 | abid2 2199 | . . . 4 ⊢ {𝑥 ∣ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}}} = {{𝐴}, {𝐴, 𝐵}} | |
7 | df-op 3407 | . . . . 5 ⊢ 〈𝐴, 𝐵〉 = {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} | |
8 | 7 | eqcomi 2085 | . . . 4 ⊢ {𝑥 ∣ (𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐴}, {𝐴, 𝐵}})} = 〈𝐴, 𝐵〉 |
9 | 5, 6, 8 | 3eqtr3g 2136 | . . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → {{𝐴}, {𝐴, 𝐵}} = 〈𝐴, 𝐵〉) |
10 | 9 | eqcomd 2086 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
11 | 1, 2, 10 | syl2an 283 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ∧ w3a 919 = wceq 1284 ∈ wcel 1433 {cab 2067 Vcvv 2601 {csn 3398 {cpr 3399 〈cop 3401 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-11 1437 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-v 2603 df-op 3407 |
This theorem is referenced by: dfop 3569 opexg 3983 opth1 3991 opth 3992 0nelop 4003 op1stbg 4228 |
Copyright terms: Public domain | W3C validator |