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

Theorem zfcndrep 10692
Description: Axiom of Replacement ax-rep 5232, reproved from conditionless ZFC axioms. Usage of this theorem is discouraged because it depends on ax-13 2402. (Contributed by NM, 15-Aug-2003.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
zfcndrep (∀𝑤∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))
Distinct variable group:   𝑥,𝑦,𝑧,𝑤
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem zfcndrep
StepHypRef Expression
1 nfe1 2187 . . . . . 6 Ⅎ𝑦∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦)
2 nfv 1947 . . . . . . . 8 Ⅎ𝑦 𝑧 ∈ 𝑤
3 nfv 1947 . . . . . . . . . 10 Ⅎ𝑦 𝑤 ∈ 𝑥
4 nfa1 2188 . . . . . . . . . 10 Ⅎ𝑦∀𝑦∀𝑦𝜑
53, 4nfan 1932 . . . . . . . . 9 Ⅎ𝑦(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)
65nfex 2355 . . . . . . . 8 Ⅎ𝑦∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)
72, 6nfbi 1936 . . . . . . 7 Ⅎ𝑦(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑))
87nfal 2354 . . . . . 6 Ⅎ𝑦∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑))
91, 8nfim 1929 . . . . 5 Ⅎ𝑦(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))
109nfex 2355 . . . 4 Ⅎ𝑦∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))
11 elequ2 2160 . . . . . . . . . 10 (𝑦 = 𝑥 → (𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑥))
1211anbi1d 643 . . . . . . . . 9 (𝑦 = 𝑥 → ((𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑) ↔ (𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))
1312exbidv 1954 . . . . . . . 8 (𝑦 = 𝑥 → (∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑) ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))
1413bibi2d 345 . . . . . . 7 (𝑦 = 𝑥 → ((𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)) ↔ (𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑))))
1514albidv 1953 . . . . . 6 (𝑦 = 𝑥 → (∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)) ↔ ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑))))
1615imbi2d 343 . . . . 5 (𝑦 = 𝑥 → ((∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))) ↔ (∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))))
1716exbidv 1954 . . . 4 (𝑦 = 𝑥 → (∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))) ↔ ∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))))
18 axrepnd 10672 . . . . 5 ∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧 ∈ 𝑤 ↔ ∃𝑤(∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)))
19 19.3v 2015 . . . . . . . . 9 (∀𝑦 𝑧 ∈ 𝑤 ↔ 𝑧 ∈ 𝑤)
20 19.3v 2015 . . . . . . . . . . 11 (∀𝑧 𝑤 ∈ 𝑦 ↔ 𝑤 ∈ 𝑦)
2120anbi1i 636 . . . . . . . . . 10 ((∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑) ↔ (𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))
2221exbii 1881 . . . . . . . . 9 (∃𝑤(∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑) ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))
2319, 22bibi12i 342 . . . . . . . 8 ((∀𝑦 𝑧 ∈ 𝑤 ↔ ∃𝑤(∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)) ↔ (𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)))
2423albii 1852 . . . . . . 7 (∀𝑧(∀𝑦 𝑧 ∈ 𝑤 ↔ ∃𝑤(∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)) ↔ ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)))
2524imbi2i 339 . . . . . 6 ((∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧 ∈ 𝑤 ↔ ∃𝑤(∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))) ↔ (∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))))
2625exbii 1881 . . . . 5 (∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(∀𝑦 𝑧 ∈ 𝑤 ↔ ∃𝑤(∀𝑧 𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))) ↔ ∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑))))
2718, 26mpbi 233 . . . 4 ∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑦 ∧ ∀𝑦∀𝑦𝜑)))
2810, 17, 27chvar 2425 . . 3 ∃𝑤(∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))
292819.35i 1911 . 2 (∀𝑤∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑤∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)))
30 nfv 1947 . . . . 5 Ⅎ𝑤 𝑧 ∈ 𝑦
31 nfe1 2187 . . . . 5 Ⅎ𝑤∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)
3230, 31nfbi 1936 . . . 4 Ⅎ𝑤(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))
3332nfal 2354 . . 3 Ⅎ𝑤∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))
34 elequ2 2160 . . . . 5 (𝑤 = 𝑦 → (𝑧 ∈ 𝑤 ↔ 𝑧 ∈ 𝑦))
35 nfa1 2188 . . . . . . . . 9 Ⅎ𝑦∀𝑦𝜑
363519.3 2239 . . . . . . . 8 (∀𝑦∀𝑦𝜑 ↔ ∀𝑦𝜑)
3736anbi2i 635 . . . . . . 7 ((𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑) ↔ (𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))
3837exbii 1881 . . . . . 6 (∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑) ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))
3938a1i 11 . . . . 5 (𝑤 = 𝑦 → (∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑) ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))
4034, 39bibi12d 348 . . . 4 (𝑤 = 𝑦 → ((𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)) ↔ (𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))
4140albidv 1953 . . 3 (𝑤 = 𝑦 → (∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)) ↔ ∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑))))
428, 33, 41cbvexv1 2372 . 2 (∃𝑤∀𝑧(𝑧 ∈ 𝑤 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦∀𝑦𝜑)) ↔ ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))
4329, 42sylib 221 1 (∀𝑤∃𝑦∀𝑧(∀𝑦𝜑 → 𝑧 = 𝑦) → ∃𝑦∀𝑧(𝑧 ∈ 𝑦 ↔ ∃𝑤(𝑤 ∈ 𝑥 ∧ ∀𝑦𝜑)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145
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-11 2194  ax-12 2213  ax-13 2402  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-reg 9579
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-cleq 2753  df-clel 2836  df-nfc 2910
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator