| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nd4 | Structured version Visualization version GIF version | ||
| Description: A lemma for proving conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2402. (Contributed by NM, 2-Jan-2002.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| nd4 | ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑧 𝑦 ∈ 𝑥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nd3 10544 | . 2 ⊢ (∀𝑦 𝑦 = 𝑥 → ¬ ∀𝑧 𝑦 ∈ 𝑥) | |
| 2 | 1 | aecoms 2458 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → ¬ ∀𝑧 𝑦 ∈ 𝑥) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∀wal 1557 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-12 2211 ax-13 2402 ax-sep 5245 ax-reg 9537 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1799 df-nf 1803 |
| This theorem is referenced by: axrepnd 10549 |
| Copyright terms: Public domain | W3C validator |