Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfiin | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for indexed intersection. (Contributed by Mario Carneiro, 25-Jan-2014.) Add disjoint variable condition to avoid ax-13 2370. See nfiing 4975 for a less restrictive version requiring more axioms. (Revised by Gino Giotto, 20-Jan-2024.) |
Ref | Expression |
---|---|
nfiun.1 | ⊢ Ⅎ𝑦𝐴 |
nfiun.2 | ⊢ Ⅎ𝑦𝐵 |
Ref | Expression |
---|---|
nfiin | ⊢ Ⅎ𝑦∩ 𝑥 ∈ 𝐴 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-iin 4945 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
2 | nfiun.1 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
3 | nfiun.2 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
4 | 3 | nfcri 2891 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
5 | 2, 4 | nfralw 3290 | . . 3 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 |
6 | 5 | nfab 2910 | . 2 ⊢ Ⅎ𝑦{𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} |
7 | 1, 6 | nfcxfr 2902 | 1 ⊢ Ⅎ𝑦∩ 𝑥 ∈ 𝐴 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2105 {cab 2713 Ⅎwnfc 2884 ∀wral 3061 ∩ ciin 4943 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 397 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ral 3062 df-iin 4945 |
This theorem is referenced by: iinab 5016 fnlimcnv 43596 fnlimfvre 43603 fnlimabslt 43608 iinhoiicc 44601 preimageiingt 44647 preimaleiinlt 44648 smflimlem6 44703 smflim 44704 smflim2 44733 smfsup 44741 smfsupmpt 44742 smfsupxr 44743 smfinflem 44744 smfinf 44745 smfinfmpt 44746 smflimsup 44755 smfliminf 44758 |
Copyright terms: Public domain | W3C validator |