Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfop | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for ordered pairs. (Contributed by NM, 14-Nov-1995.) |
Ref | Expression |
---|---|
nfop.1 | ⊢ Ⅎ𝑥𝐴 |
nfop.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
nfop | ⊢ Ⅎ𝑥〈𝐴, 𝐵〉 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfopif 4803 | . 2 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
2 | nfop.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | nfel1 2997 | . . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ V |
4 | nfop.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
5 | 4 | nfel1 2997 | . . . 4 ⊢ Ⅎ𝑥 𝐵 ∈ V |
6 | 3, 5 | nfan 1899 | . . 3 ⊢ Ⅎ𝑥(𝐴 ∈ V ∧ 𝐵 ∈ V) |
7 | 2 | nfsn 4646 | . . . 4 ⊢ Ⅎ𝑥{𝐴} |
8 | 2, 4 | nfpr 4631 | . . . 4 ⊢ Ⅎ𝑥{𝐴, 𝐵} |
9 | 7, 8 | nfpr 4631 | . . 3 ⊢ Ⅎ𝑥{{𝐴}, {𝐴, 𝐵}} |
10 | nfcv 2980 | . . 3 ⊢ Ⅎ𝑥∅ | |
11 | 6, 9, 10 | nfif 4499 | . 2 ⊢ Ⅎ𝑥if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) |
12 | 1, 11 | nfcxfr 2978 | 1 ⊢ Ⅎ𝑥〈𝐴, 𝐵〉 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 ∈ wcel 2113 Ⅎwnfc 2964 Vcvv 3497 ∅c0 4294 ifcif 4470 {csn 4570 {cpr 4572 〈cop 4576 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-v 3499 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 |
This theorem is referenced by: nfopd 4823 moop2 5395 iunopeqop 5414 fliftfuns 7070 dfmpo 7800 qliftfuns 8387 xpf1o 8682 nfseq 13382 txcnp 22231 cnmpt1t 22276 cnmpt2t 22284 flfcnp2 22618 bnj958 32216 bnj1000 32217 bnj1446 32321 bnj1447 32322 bnj1448 32323 bnj1466 32329 bnj1467 32330 bnj1519 32341 bnj1520 32342 bnj1529 32346 nosupbnd2 33220 poimirlem26 34922 nfopdALT 36111 nfaov 43385 |
Copyright terms: Public domain | W3C validator |