Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opelopabsbALT | Structured version Visualization version GIF version |
Description: The law of concretion in terms of substitutions. Less general than opelopabsb 5419, but having a much shorter proof. (Contributed by NM, 30-Sep-2002.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
opelopabsbALT | ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ [𝑤 / 𝑦][𝑧 / 𝑥]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | excom 2169 | . . 3 ⊢ (∃𝑥∃𝑦(〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
2 | vex 3499 | . . . . . . 7 ⊢ 𝑧 ∈ V | |
3 | vex 3499 | . . . . . . 7 ⊢ 𝑤 ∈ V | |
4 | 2, 3 | opth 5370 | . . . . . 6 ⊢ (〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ↔ (𝑧 = 𝑥 ∧ 𝑤 = 𝑦)) |
5 | equcom 2025 | . . . . . . 7 ⊢ (𝑧 = 𝑥 ↔ 𝑥 = 𝑧) | |
6 | equcom 2025 | . . . . . . 7 ⊢ (𝑤 = 𝑦 ↔ 𝑦 = 𝑤) | |
7 | 5, 6 | anbi12ci 629 | . . . . . 6 ⊢ ((𝑧 = 𝑥 ∧ 𝑤 = 𝑦) ↔ (𝑦 = 𝑤 ∧ 𝑥 = 𝑧)) |
8 | 4, 7 | bitri 277 | . . . . 5 ⊢ (〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ↔ (𝑦 = 𝑤 ∧ 𝑥 = 𝑧)) |
9 | 8 | anbi1i 625 | . . . 4 ⊢ ((〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ((𝑦 = 𝑤 ∧ 𝑥 = 𝑧) ∧ 𝜑)) |
10 | 9 | 2exbii 1849 | . . 3 ⊢ (∃𝑦∃𝑥(〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥((𝑦 = 𝑤 ∧ 𝑥 = 𝑧) ∧ 𝜑)) |
11 | 1, 10 | bitri 277 | . 2 ⊢ (∃𝑥∃𝑦(〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑦∃𝑥((𝑦 = 𝑤 ∧ 𝑥 = 𝑧) ∧ 𝜑)) |
12 | elopab 5416 | . 2 ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ ∃𝑥∃𝑦(〈𝑧, 𝑤〉 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
13 | 2sb5 2282 | . 2 ⊢ ([𝑤 / 𝑦][𝑧 / 𝑥]𝜑 ↔ ∃𝑦∃𝑥((𝑦 = 𝑤 ∧ 𝑥 = 𝑧) ∧ 𝜑)) | |
14 | 11, 12, 13 | 3bitr4i 305 | 1 ⊢ (〈𝑧, 𝑤〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ [𝑤 / 𝑦][𝑧 / 𝑥]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∃wex 1780 [wsb 2069 ∈ wcel 2114 〈cop 4575 {copab 5130 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-opab 5131 |
This theorem is referenced by: inopab 5703 cnvopab 5999 brabsb2 36000 |
Copyright terms: Public domain | W3C validator |