| 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 5927 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {〈〈𝑥, 𝑦〉, 𝑤〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑤 = 𝐶)} | |
| 2 | nfmpo.1 | . . . . . 6 ⊢ Ⅎ𝑧𝐴 | |
| 3 | 2 | nfcri 2333 | . . . . 5 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴 |
| 4 | nfmpo.2 | . . . . . 6 ⊢ Ⅎ𝑧𝐵 | |
| 5 | 4 | nfcri 2333 | . . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ 𝐵 |
| 6 | 3, 5 | nfan 1579 | . . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) |
| 7 | nfmpo.3 | . . . . 5 ⊢ Ⅎ𝑧𝐶 | |
| 8 | 7 | nfeq2 2351 | . . . 4 ⊢ Ⅎ𝑧 𝑤 = 𝐶 |
| 9 | 6, 8 | nfan 1579 | . . 3 ⊢ Ⅎ𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑤 = 𝐶) |
| 10 | 9 | nfoprab 5974 | . 2 ⊢ Ⅎ𝑧{〈〈𝑥, 𝑦〉, 𝑤〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑤 = 𝐶)} |
| 11 | 1, 10 | nfcxfr 2336 | 1 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 = wceq 1364 ∈ wcel 2167 Ⅎwnfc 2326 {coprab 5923 ∈ cmpo 5924 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-oprab 5926 df-mpo 5927 |
| This theorem is referenced by: nfof 6141 nfseq 10549 |
| Copyright terms: Public domain | W3C validator |