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 4800 | . 2 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
2 | nfop.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | nfel1 2994 | . . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ V |
4 | nfop.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
5 | 4 | nfel1 2994 | . . . 4 ⊢ Ⅎ𝑥 𝐵 ∈ V |
6 | 3, 5 | nfan 1900 | . . 3 ⊢ Ⅎ𝑥(𝐴 ∈ V ∧ 𝐵 ∈ V) |
7 | 2 | nfsn 4643 | . . . 4 ⊢ Ⅎ𝑥{𝐴} |
8 | 2, 4 | nfpr 4628 | . . . 4 ⊢ Ⅎ𝑥{𝐴, 𝐵} |
9 | 7, 8 | nfpr 4628 | . . 3 ⊢ Ⅎ𝑥{{𝐴}, {𝐴, 𝐵}} |
10 | nfcv 2977 | . . 3 ⊢ Ⅎ𝑥∅ | |
11 | 6, 9, 10 | nfif 4496 | . 2 ⊢ Ⅎ𝑥if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) |
12 | 1, 11 | nfcxfr 2975 | 1 ⊢ Ⅎ𝑥〈𝐴, 𝐵〉 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 ∈ wcel 2114 Ⅎwnfc 2961 Vcvv 3494 ∅c0 4291 ifcif 4467 {csn 4567 {cpr 4569 〈cop 4573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 |
This theorem is referenced by: nfopd 4820 moop2 5392 iunopeqop 5411 fliftfuns 7067 dfmpo 7797 qliftfuns 8384 xpf1o 8679 nfseq 13380 txcnp 22228 cnmpt1t 22273 cnmpt2t 22281 flfcnp2 22615 bnj958 32212 bnj1000 32213 bnj1446 32317 bnj1447 32318 bnj1448 32319 bnj1466 32325 bnj1467 32326 bnj1519 32337 bnj1520 32338 bnj1529 32342 nosupbnd2 33216 poimirlem26 34933 nfopdALT 36122 nfaov 43398 |
Copyright terms: Public domain | W3C validator |