Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfral | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for restricted quantification. Usage of this theorem is discouraged because it depends on ax-13 2379. Use the weaker nfralw 3189 when possible. (Contributed by NM, 1-Sep-1999.) (Revised by Mario Carneiro, 7-Oct-2016.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nfral.1 | ⊢ Ⅎ𝑥𝐴 |
nfral.2 | ⊢ Ⅎ𝑥𝜑 |
Ref | Expression |
---|---|
nfral | ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜑 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nftru 1806 | . . 3 ⊢ Ⅎ𝑦⊤ | |
2 | nfral.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | a1i 11 | . . 3 ⊢ (⊤ → Ⅎ𝑥𝐴) |
4 | nfral.2 | . . . 4 ⊢ Ⅎ𝑥𝜑 | |
5 | 4 | a1i 11 | . . 3 ⊢ (⊤ → Ⅎ𝑥𝜑) |
6 | 1, 3, 5 | nfrald 3188 | . 2 ⊢ (⊤ → Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜑) |
7 | 6 | mptru 1545 | 1 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜑 |
Colors of variables: wff setvar class |
Syntax hints: ⊤wtru 1539 Ⅎwnf 1785 Ⅎwnfc 2936 ∀wral 3106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-13 2379 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 |
This theorem is referenced by: nfra2 3192 nfiing 4914 opreu2reuALT 30247 eliuniincex 41745 cbvral2 43658 |
Copyright terms: Public domain | W3C validator |