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

Theorem isarep2 6593
Description: Part of a study of the Axiom of Replacement used by the Isabelle prover. In Isabelle, the sethood of PrimReplace is apparently postulated implicitly by its type signature "[ i, [ i, i ] => o ] => i", which automatically asserts that it is a set without using any axioms. To prove that it is a set in Metamath, we need the hypotheses of Isabelle's "Axiom of Replacement" as well as the Axiom of Replacement in the form funimaex 6590. (Contributed by NM, 26-Oct-2006.)
Hypotheses
Ref Expression
isarep2.1 𝐴 ∈ V
isarep2.2 𝑥𝐴𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧)
Assertion
Ref Expression
isarep2 𝑤 𝑤 = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
Distinct variable groups:   𝑥,𝑤,𝑦,𝐴   𝑦,𝑧   𝜑,𝑤   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑧)

Proof of Theorem isarep2
StepHypRef Expression
1 resima 5972 . . . 4 (({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
2 resopab 5989 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
32imaeq1i 6011 . . . 4 (({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴)
41, 3eqtr3i 2763 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴)
5 funopab 6537 . . . . 5 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ↔ ∀𝑥∃*𝑦(𝑥𝐴𝜑))
6 isarep2.2 . . . . . . . 8 𝑥𝐴𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧)
76rspec 3232 . . . . . . 7 (𝑥𝐴 → ∀𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧))
8 nfv 1918 . . . . . . . 8 𝑧𝜑
98mo3 2559 . . . . . . 7 (∃*𝑦𝜑 ↔ ∀𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧))
107, 9sylibr 233 . . . . . 6 (𝑥𝐴 → ∃*𝑦𝜑)
11 moanimv 2616 . . . . . 6 (∃*𝑦(𝑥𝐴𝜑) ↔ (𝑥𝐴 → ∃*𝑦𝜑))
1210, 11mpbir 230 . . . . 5 ∃*𝑦(𝑥𝐴𝜑)
135, 12mpgbir 1802 . . . 4 Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
14 isarep2.1 . . . . 5 𝐴 ∈ V
1514funimaex 6590 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴) ∈ V)
1613, 15ax-mp 5 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴) ∈ V
174, 16eqeltri 2830 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴) ∈ V
1817isseti 3459 1 𝑤 𝑤 = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397  wal 1540   = wceq 1542  wex 1782  [wsb 2068  wcel 2107  ∃*wmo 2533  wral 3061  Vcvv 3444  {copab 5168  cres 5636  cima 5637  Fun wfun 6491
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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-rep 5243  ax-sep 5257  ax-nul 5264  ax-pr 5385
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-br 5107  df-opab 5169  df-id 5532  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-fun 6499
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator