![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > opelopabf | GIF version |
Description: The law of concretion. Theorem 9.5 of [Quine] p. 61. This version of opelopab 4302 uses bound-variable hypotheses in place of distinct variable conditions. (Contributed by NM, 19-Dec-2008.) |
Ref | Expression |
---|---|
opelopabf.x | ⊢ Ⅎ𝑥𝜓 |
opelopabf.y | ⊢ Ⅎ𝑦𝜒 |
opelopabf.1 | ⊢ 𝐴 ∈ V |
opelopabf.2 | ⊢ 𝐵 ∈ V |
opelopabf.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
opelopabf.4 | ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
opelopabf | ⊢ (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 𝜒) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelopabsb 4290 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ [𝐴 / 𝑥][𝐵 / 𝑦]𝜑) | |
2 | opelopabf.1 | . . 3 ⊢ 𝐴 ∈ V | |
3 | nfcv 2336 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
4 | opelopabf.x | . . . . 5 ⊢ Ⅎ𝑥𝜓 | |
5 | 3, 4 | nfsbc 3006 | . . . 4 ⊢ Ⅎ𝑥[𝐵 / 𝑦]𝜓 |
6 | opelopabf.3 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
7 | 6 | sbcbidv 3044 | . . . 4 ⊢ (𝑥 = 𝐴 → ([𝐵 / 𝑦]𝜑 ↔ [𝐵 / 𝑦]𝜓)) |
8 | 5, 7 | sbciegf 3017 | . . 3 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [𝐵 / 𝑦]𝜓)) |
9 | 2, 8 | ax-mp 5 | . 2 ⊢ ([𝐴 / 𝑥][𝐵 / 𝑦]𝜑 ↔ [𝐵 / 𝑦]𝜓) |
10 | opelopabf.2 | . . 3 ⊢ 𝐵 ∈ V | |
11 | opelopabf.y | . . . 4 ⊢ Ⅎ𝑦𝜒 | |
12 | opelopabf.4 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
13 | 11, 12 | sbciegf 3017 | . . 3 ⊢ (𝐵 ∈ V → ([𝐵 / 𝑦]𝜓 ↔ 𝜒)) |
14 | 10, 13 | ax-mp 5 | . 2 ⊢ ([𝐵 / 𝑦]𝜓 ↔ 𝜒) |
15 | 1, 9, 14 | 3bitri 206 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ 𝜑} ↔ 𝜒) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 = wceq 1364 Ⅎwnf 1471 ∈ wcel 2164 Vcvv 2760 [wsbc 2985 〈cop 3621 {copab 4089 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-rex 2478 df-v 2762 df-sbc 2986 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-opab 4091 |
This theorem is referenced by: pofun 4343 fmptco 5724 uchoice 6190 |
Copyright terms: Public domain | W3C validator |