Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfss | Structured version Visualization version GIF version |
Description: If 𝑥 is not free in 𝐴 and 𝐵, it is not free in 𝐴 ⊆ 𝐵. (Contributed by NM, 27-Dec-1996.) |
Ref | Expression |
---|---|
dfss2f.1 | ⊢ Ⅎ𝑥𝐴 |
dfss2f.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
nfss | ⊢ Ⅎ𝑥 𝐴 ⊆ 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfss2f.1 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
2 | dfss2f.2 | . . 3 ⊢ Ⅎ𝑥𝐵 | |
3 | 1, 2 | dfss3f 3962 | . 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ 𝐵) |
4 | nfra1 3222 | . 2 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝑥 ∈ 𝐵 | |
5 | 3, 4 | nfxfr 1852 | 1 ⊢ Ⅎ𝑥 𝐴 ⊆ 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnf 1783 ∈ wcel 2113 Ⅎwnfc 2964 ∀wral 3141 ⊆ wss 3939 |
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-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ral 3146 df-in 3946 df-ss 3955 |
This theorem is referenced by: ssrexf 4034 nfpw 4563 ssiun2s 4975 triun 5188 iunopeqop 5414 ssopab2bw 5437 ssopab2b 5439 nffr 5532 nfrel 5657 nffun 6381 nff 6513 fvmptss 6783 ssoprab2b 7226 eqoprab2bw 7227 tfis 7572 ovmptss 7791 nfwrecs 7952 oawordeulem 8183 nnawordex 8266 r1val1 9218 cardaleph 9518 nfsum1 15049 nfsumw 15050 nfsum 15051 nfcprod1 15267 nfcprod 15268 iunconn 22039 ovolfiniun 24105 ovoliunlem3 24108 ovoliun 24109 ovoliun2 24110 ovoliunnul 24111 limciun 24495 ssiun2sf 30314 ssrelf 30369 funimass4f 30385 fsumiunle 30549 prodindf 31286 esumiun 31357 bnj1408 32312 nffrecs 33124 totbndbnd 35071 ss2iundf 40010 iunconnlem2 41275 iinssdf 41414 rnmptssbi 41540 stoweidlem53 42345 stoweidlem57 42349 meaiunincf 42772 meaiuninc3 42774 opnvonmbllem2 42922 smflim 43060 nfsetrecs 44796 setrec2fun 44802 |
Copyright terms: Public domain | W3C validator |