Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfint | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for intersection. (Contributed by NM, 2-Feb-1997.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) |
Ref | Expression |
---|---|
nfint.1 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
nfint | ⊢ Ⅎ𝑥∩ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfint2 4870 | . 2 ⊢ ∩ 𝐴 = {𝑦 ∣ ∀𝑧 ∈ 𝐴 𝑦 ∈ 𝑧} | |
2 | nfint.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | nfv 1911 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝑧 | |
4 | 2, 3 | nfralw 3225 | . . 3 ⊢ Ⅎ𝑥∀𝑧 ∈ 𝐴 𝑦 ∈ 𝑧 |
5 | 4 | nfab 2984 | . 2 ⊢ Ⅎ𝑥{𝑦 ∣ ∀𝑧 ∈ 𝐴 𝑦 ∈ 𝑧} |
6 | 1, 5 | nfcxfr 2975 | 1 ⊢ Ⅎ𝑥∩ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: {cab 2799 Ⅎwnfc 2961 ∀wral 3138 ∩ cint 4868 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-int 4869 |
This theorem is referenced by: onminsb 7508 oawordeulem 8174 nnawordex 8257 rankidb 9223 cardmin2 9421 cardaleph 9509 cardmin 9980 ldsysgenld 31414 sltval2 33158 aomclem8 39654 |
Copyright terms: Public domain | W3C validator |