MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zfregclOLD Structured version   Visualization version   GIF version

Theorem zfregclOLD 9567
Description: Obsolete version of zfregcl 9566 as of 31-Dec-2025. (Contributed by NM, 5-Aug-1994.) Replace sethood hypothesis with sethood antecedent. (Revised by BJ, 27-Apr-2021.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
zfregclOLD (𝐴 ∈ 𝑉 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴))
Distinct variable group:   𝑥,𝐴,𝑦
Allowed substitution hints:   𝑉(𝑥, 𝑦)

Proof of Theorem zfregclOLD
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eleq2 2849 . . . 4 (𝑧 = 𝐴 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝐴))
21exbidv 1954 . . 3 (𝑧 = 𝐴 → (∃𝑥 𝑥 ∈ 𝑧 ↔ ∃𝑥 𝑥 ∈ 𝐴))
3 eleq2 2849 . . . . . 6 (𝑧 = 𝐴 → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ 𝐴))
43notbid 321 . . . . 5 (𝑧 = 𝐴 → (¬ 𝑦 ∈ 𝑧 ↔ ¬ 𝑦 ∈ 𝐴))
54ralbidv 3185 . . . 4 (𝑧 = 𝐴 → (∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧 ↔ ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴))
65rexeqbi1dv 3330 . . 3 (𝑧 = 𝐴 → (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴))
72, 6imbi12d 347 . 2 (𝑧 = 𝐴 → ((∃𝑥 𝑥 ∈ 𝑧 → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧) ↔ (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴)))
8 nfre1 3287 . . 3 Ⅎ𝑥∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧
9 axreg2 9565 . . . 4 (𝑥 ∈ 𝑧 → ∃𝑥(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝑦 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑧)))
10 df-ral 3077 . . . . . 6 (∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧 ↔ ∀𝑦(𝑦 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑧))
1110rexbii 3109 . . . . 5 (∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧 ↔ ∃𝑥 ∈ 𝑧 ∀𝑦(𝑦 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑧))
12 df-rex 3087 . . . . 5 (∃𝑥 ∈ 𝑧 ∀𝑦(𝑦 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑧) ↔ ∃𝑥(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝑦 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑧)))
1311, 12bitr2i 279 . . . 4 (∃𝑥(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝑦 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑧)) ↔ ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧)
149, 13sylib 221 . . 3 (𝑥 ∈ 𝑧 → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧)
158, 14exlimi 2253 . 2 (∃𝑥 𝑥 ∈ 𝑧 → ∃𝑥 ∈ 𝑧 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝑧)
167, 15vtoclg 3517 1 (𝐴 ∈ 𝑉 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 ¬ 𝑦 ∈ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086
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 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2732  ax-reg 9564
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator