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 4712 | . . . . . 6 ⊢ (𝐴 × 𝐵) ⊆ (V × V) | |
2 | 1 | sseli 3138 | . . . . 5 ⊢ (𝑤 ∈ (𝐴 × 𝐵) → 𝑤 ∈ (V × V)) |
3 | 2 | adantr 274 | . . . 4 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) → 𝑤 ∈ (V × V)) |
4 | 3 | pm4.71ri 390 | . . 3 ⊢ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))) |
5 | 4 | opabbii 4049 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))} |
6 | eleq1 2229 | . . . . 5 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝑤 ∈ (𝐴 × 𝐵) ↔ 〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵))) | |
7 | opelxp 4634 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
8 | 6, 7 | bitrdi 195 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝑤 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
9 | dfoprab4.1 | . . . 4 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) | |
10 | 8, 9 | anbi12d 465 | . . 3 ⊢ (𝑤 = 〈𝑥, 𝑦〉 → ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓))) |
11 | 10 | dfoprab3 6159 | . 2 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (V × V) ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑))} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
12 | 5, 11 | eqtri 2186 | 1 ⊢ {〈𝑤, 𝑧〉 ∣ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1343 ∈ wcel 2136 Vcvv 2726 〈cop 3579 {copab 4042 × cxp 4602 {coprab 5843 |
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 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-sbc 2952 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-mpt 4045 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-rn 4615 df-iota 5153 df-fun 5190 df-fn 5191 df-f 5192 df-fo 5194 df-fv 5196 df-oprab 5846 df-1st 6108 df-2nd 6109 |
This theorem is referenced by: dfoprab4f 6161 dfxp3 6162 |
Copyright terms: Public domain | W3C validator |