Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfsab | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.) Add disjoint variable condition to avoid ax-13 2372. See nfsabg 2729 for a less restrictive version requiring more axioms. (Revised by Gino Giotto, 20-Jan-2024.) |
Ref | Expression |
---|---|
nfsab.1 | ⊢ Ⅎ𝑥𝜑 |
Ref | Expression |
---|---|
nfsab | ⊢ Ⅎ𝑥 𝑧 ∈ {𝑦 ∣ 𝜑} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfsab.1 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
2 | 1 | nf5ri 2188 | . . 3 ⊢ (𝜑 → ∀𝑥𝜑) |
3 | 2 | hbab 2726 | . 2 ⊢ (𝑧 ∈ {𝑦 ∣ 𝜑} → ∀𝑥 𝑧 ∈ {𝑦 ∣ 𝜑}) |
4 | 3 | nf5i 2142 | 1 ⊢ Ⅎ𝑥 𝑧 ∈ {𝑦 ∣ 𝜑} |
Colors of variables: wff setvar class |
Syntax hints: Ⅎwnf 1786 ∈ wcel 2106 {cab 2715 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-10 2137 ax-11 2154 ax-12 2171 |
This theorem depends on definitions: df-bi 206 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 |
This theorem is referenced by: nfab 2913 upbdrech 42844 ssfiunibd 42848 |
Copyright terms: Public domain | W3C validator |