Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > nfmpo | GIF version |
Description: Bound-variable hypothesis builder for the maps-to notation. (Contributed by NM, 20-Feb-2013.) |
Ref | Expression |
---|---|
nfmpo.1 | ⊢ Ⅎ𝑧𝐴 |
nfmpo.2 | ⊢ Ⅎ𝑧𝐵 |
nfmpo.3 | ⊢ Ⅎ𝑧𝐶 |
Ref | Expression |
---|---|
nfmpo | ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-mpo 5779 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {〈〈𝑥, 𝑦〉, 𝑤〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑤 = 𝐶)} | |
2 | nfmpo.1 | . . . . . 6 ⊢ Ⅎ𝑧𝐴 | |
3 | 2 | nfcri 2275 | . . . . 5 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴 |
4 | nfmpo.2 | . . . . . 6 ⊢ Ⅎ𝑧𝐵 | |
5 | 4 | nfcri 2275 | . . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ 𝐵 |
6 | 3, 5 | nfan 1544 | . . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) |
7 | nfmpo.3 | . . . . 5 ⊢ Ⅎ𝑧𝐶 | |
8 | 7 | nfeq2 2293 | . . . 4 ⊢ Ⅎ𝑧 𝑤 = 𝐶 |
9 | 6, 8 | nfan 1544 | . . 3 ⊢ Ⅎ𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑤 = 𝐶) |
10 | 9 | nfoprab 5823 | . 2 ⊢ Ⅎ𝑧{〈〈𝑥, 𝑦〉, 𝑤〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑤 = 𝐶)} |
11 | 1, 10 | nfcxfr 2278 | 1 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 = wceq 1331 ∈ wcel 1480 Ⅎwnfc 2268 {coprab 5775 ∈ cmpo 5776 |
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-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-oprab 5778 df-mpo 5779 |
This theorem is referenced by: nfof 5987 nfseq 10228 |
Copyright terms: Public domain | W3C validator |