Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > elsnres | GIF version |
Description: Memebership in restriction to a singleton. (Contributed by Scott Fenton, 17-Mar-2011.) |
Ref | Expression |
---|---|
elsnres.1 | ⊢ 𝐶 ∈ V |
Ref | Expression |
---|---|
elsnres | ⊢ (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑦(𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elres 4920 | . 2 ⊢ (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑥 ∈ {𝐶}∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
2 | rexcom4 2749 | . 2 ⊢ (∃𝑥 ∈ {𝐶}∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ ∃𝑦∃𝑥 ∈ {𝐶} (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
3 | elsnres.1 | . . . 4 ⊢ 𝐶 ∈ V | |
4 | opeq1 3758 | . . . . . 6 ⊢ (𝑥 = 𝐶 → 〈𝑥, 𝑦〉 = 〈𝐶, 𝑦〉) | |
5 | 4 | eqeq2d 2177 | . . . . 5 ⊢ (𝑥 = 𝐶 → (𝐴 = 〈𝑥, 𝑦〉 ↔ 𝐴 = 〈𝐶, 𝑦〉)) |
6 | 4 | eleq1d 2235 | . . . . 5 ⊢ (𝑥 = 𝐶 → (〈𝑥, 𝑦〉 ∈ 𝐵 ↔ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
7 | 5, 6 | anbi12d 465 | . . . 4 ⊢ (𝑥 = 𝐶 → ((𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵))) |
8 | 3, 7 | rexsn 3620 | . . 3 ⊢ (∃𝑥 ∈ {𝐶} (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
9 | 8 | exbii 1593 | . 2 ⊢ (∃𝑦∃𝑥 ∈ {𝐶} (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ ∃𝑦(𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
10 | 1, 2, 9 | 3bitri 205 | 1 ⊢ (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑦(𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 = wceq 1343 ∃wex 1480 ∈ wcel 2136 ∃wrex 2445 Vcvv 2726 {csn 3576 〈cop 3579 ↾ cres 4606 |
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-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 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-opab 4044 df-xp 4610 df-rel 4611 df-res 4616 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |