Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nf2 | Structured version Visualization version GIF version |
Description: Alternate definition of non-freeness. (Contributed by BJ, 16-Sep-2021.) |
Ref | Expression |
---|---|
nf2 | ⊢ (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-nf 1701 | . 2 ⊢ (Ⅎ𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑)) | |
2 | imor 427 | . 2 ⊢ ((∃𝑥𝜑 → ∀𝑥𝜑) ↔ (¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑)) | |
3 | orcom 401 | . 2 ⊢ ((¬ ∃𝑥𝜑 ∨ ∀𝑥𝜑) ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑)) | |
4 | 1, 2, 3 | 3bitri 285 | 1 ⊢ (Ⅎ𝑥𝜑 ↔ (∀𝑥𝜑 ∨ ¬ ∃𝑥𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∨ wo 382 ∀wal 1473 ∃wex 1695 Ⅎwnf 1699 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 196 df-or 384 df-nf 1701 |
This theorem is referenced by: nf3 1703 nfntht 1710 |
Copyright terms: Public domain | W3C validator |