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 4337 | . 2 ⊢ 〈𝐴, 𝐵〉 = if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) | |
2 | nfop.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | nfel1 2765 | . . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ V |
4 | nfop.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
5 | 4 | nfel1 2765 | . . . 4 ⊢ Ⅎ𝑥 𝐵 ∈ V |
6 | 3, 5 | nfan 1816 | . . 3 ⊢ Ⅎ𝑥(𝐴 ∈ V ∧ 𝐵 ∈ V) |
7 | 2 | nfsn 4189 | . . . 4 ⊢ Ⅎ𝑥{𝐴} |
8 | 2, 4 | nfpr 4179 | . . . 4 ⊢ Ⅎ𝑥{𝐴, 𝐵} |
9 | 7, 8 | nfpr 4179 | . . 3 ⊢ Ⅎ𝑥{{𝐴}, {𝐴, 𝐵}} |
10 | nfcv 2751 | . . 3 ⊢ Ⅎ𝑥∅ | |
11 | 6, 9, 10 | nfif 4065 | . 2 ⊢ Ⅎ𝑥if((𝐴 ∈ V ∧ 𝐵 ∈ V), {{𝐴}, {𝐴, 𝐵}}, ∅) |
12 | 1, 11 | nfcxfr 2749 | 1 ⊢ Ⅎ𝑥〈𝐴, 𝐵〉 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 383 ∈ wcel 1977 Ⅎwnfc 2738 Vcvv 3173 ∅c0 3874 ifcif 4036 {csn 4125 {cpr 4127 〈cop 4131 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 |
This theorem is referenced by: nfopd 4357 moop2 4891 iunopeqop 4906 fliftfuns 6464 dfmpt2 7154 qliftfuns 7721 xpf1o 8007 nfseq 12673 txcnp 21233 cnmpt1t 21278 cnmpt2t 21286 flfcnp2 21621 bnj958 30264 bnj1000 30265 bnj1446 30367 bnj1447 30368 bnj1448 30369 bnj1466 30375 bnj1467 30376 bnj1519 30387 bnj1520 30388 bnj1529 30392 poimirlem26 32605 nfopdALT 33276 nfaov 39908 |
Copyright terms: Public domain | W3C validator |