| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfrald | Structured version Visualization version GIF version | ||
| Description: Deduction version of nfral 3365. Usage of this theorem is discouraged because it depends on ax-13 2406. Use the weaker nfraldw 3312 when possible. (Contributed by NM, 15-Feb-2013.) (Revised by Mario Carneiro, 7-Oct-2016.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nfrald.1 | ⊢ Ⅎ𝑦𝜑 |
| nfrald.2 | ⊢ (𝜑 → Ⅎ𝑥𝐴) |
| nfrald.3 | ⊢ (𝜑 → Ⅎ𝑥𝜓) |
| Ref | Expression |
|---|---|
| nfrald | ⊢ (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 3082 | . 2 ⊢ (∀𝑦 ∈ 𝐴 𝜓 ↔ ∀𝑦(𝑦 ∈ 𝐴 → 𝜓)) | |
| 2 | nfrald.1 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
| 3 | nfcvf 2953 | . . . . . 6 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦) | |
| 4 | 3 | adantl 487 | . . . . 5 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝑦) |
| 5 | nfrald.2 | . . . . . 6 ⊢ (𝜑 → Ⅎ𝑥𝐴) | |
| 6 | 5 | adantr 486 | . . . . 5 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝐴) |
| 7 | 4, 6 | nfeld 2938 | . . . 4 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥 𝑦 ∈ 𝐴) |
| 8 | nfrald.3 | . . . . 5 ⊢ (𝜑 → Ⅎ𝑥𝜓) | |
| 9 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓) |
| 10 | 7, 9 | nfimd 1927 | . . 3 ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥(𝑦 ∈ 𝐴 → 𝜓)) |
| 11 | 2, 10 | nfald2 2479 | . 2 ⊢ (𝜑 → Ⅎ𝑥∀𝑦(𝑦 ∈ 𝐴 → 𝜓)) |
| 12 | 1, 11 | nfxfrd 1887 | 1 ⊢ (𝜑 → Ⅎ𝑥∀𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∀wal 1568 Ⅎwnf 1816 ∈ wcel 2146 Ⅎwnfc 2912 ∀wral 3081 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-13 2406 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 |
| This theorem is used by: nfrexd 3364 nfral 3365 |
| Copyright terms: Public domain | W3C validator |