Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > zfcndreg | Structured version Visualization version GIF version |
Description: Axiom of Regularity ax-reg 9351, reproved from conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2372. (Contributed by NM, 15-Aug-2003.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
zfcndreg | ⊢ (∃𝑦 𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfe1 2147 | . 2 ⊢ Ⅎ𝑦∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)) | |
2 | axregnd 10360 | . 2 ⊢ (𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) | |
3 | 1, 2 | exlimi 2210 | 1 ⊢ (∃𝑦 𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∀wal 1537 ∃wex 1782 ∈ wcel 2106 |
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-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-13 2372 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-reg 9351 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-v 3434 df-dif 3890 df-un 3892 df-nul 4257 df-sn 4562 df-pr 4564 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |