Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dfoprab4 | GIF version |
Description: Operation class abstraction expressed without existential quantifiers. (Contributed by NM, 3-Sep-2007.) (Revised by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
dfoprab4.1 | ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
dfoprab4 | ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpss 4617 | . . . . . 6 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
2 | 1 | sseli 3063 | . . . . 5 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → 𝑤 ∈ (V × V)) |
3 | 2 | adantr 274 | . . . 4 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) → 𝑤 ∈ (V × V)) |
4 | 3 | pm4.71ri 389 | . . 3 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))) |
5 | 4 | opabbii 3965 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))} |
6 | eleq1 2180 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝑤 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
7 | opelxp 4539 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
8 | 6, 7 | syl6bb 195 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝑤 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
9 | dfoprab4.1 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) | |
10 | 8, 9 | anbi12d 464 | . . 3 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓))) |
11 | 10 | dfoprab3 6057 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
12 | 5, 11 | eqtri 2138 | 1 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1316 ∈ wcel 1465 Vcvv 2660 〈cop 3500 {copab 3958 × cxp 4507 {coprab 5743 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-rex 2399 df-v 2662 df-sbc 2883 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-mpt 3961 df-id 4185 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-fo 5099 df-fv 5101 df-oprab 5746 df-1st 6006 df-2nd 6007 |
This theorem is referenced by: dfoprab4f 6059 dfxp3 6060 |
Copyright terms: Public domain | W3C validator |