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 4647 | . . . . . 6 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
2 | 1 | sseli 3093 | . . . . 5 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → 𝑤 ∈ (V × V)) |
3 | 2 | adantr 274 | . . . 4 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) → 𝑤 ∈ (V × V)) |
4 | 3 | pm4.71ri 389 | . . 3 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))) |
5 | 4 | opabbii 3995 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))} |
6 | eleq1 2202 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝑤 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
7 | opelxp 4569 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
8 | 6, 7 | syl6bb 195 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝑤 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
9 | dfoprab4.1 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) | |
10 | 8, 9 | anbi12d 464 | . . 3 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓))) |
11 | 10 | dfoprab3 6089 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
12 | 5, 11 | eqtri 2160 | 1 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 Vcvv 2686 〈cop 3530 {copab 3988 × cxp 4537 {coprab 5775 |
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 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-sbc 2910 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fo 5129 df-fv 5131 df-oprab 5778 df-1st 6038 df-2nd 6039 |
This theorem is referenced by: dfoprab4f 6091 dfxp3 6092 |
Copyright terms: Public domain | W3C validator |