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 9048, reproved from conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2384. (Contributed by NM, 15-Aug-2003.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
zfcndreg | ⊢ (∃𝑦 𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfe1 2148 | . 2 ⊢ Ⅎ𝑦∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥)) | |
2 | axregnd 10018 | . 2 ⊢ (𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) | |
3 | 1, 2 | exlimi 2210 | 1 ⊢ (∃𝑦 𝑦 ∈ 𝑥 → ∃𝑦(𝑦 ∈ 𝑥 ∧ ∀𝑧(𝑧 ∈ 𝑦 → ¬ 𝑧 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∀wal 1529 ∃wex 1774 ∈ wcel 2108 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-13 2384 ax-ext 2791 ax-sep 5194 ax-nul 5201 ax-pr 5320 ax-reg 9048 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ral 3141 df-rex 3142 df-v 3495 df-dif 3937 df-un 3939 df-nul 4290 df-sn 4560 df-pr 4562 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |