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

Theorem isarep2 6629
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 6627. (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 6016 . . . 4 (({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
2 resopab 6038 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
32imaeq1i 6061 . . . 4 (({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴)
41, 3eqtr3i 2790 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴)
5 funopab 6575 . . . . 5 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} ↔ ∀𝑥∃*𝑦(𝑥𝐴𝜑))
6 isarep2.2 . . . . . . . 8 𝑥𝐴𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧)
76rspec 3258 . . . . . . 7 (𝑥𝐴 → ∀𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧))
8 nfv 1947 . . . . . . . 8 𝑧𝜑
98mo3 2594 . . . . . . 7 (∃*𝑦𝜑 ↔ ∀𝑦𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧))
107, 9sylibr 237 . . . . . 6 (𝑥𝐴 → ∃*𝑦𝜑)
11 moanimv 2649 . . . . . 6 (∃*𝑦(𝑥𝐴𝜑) ↔ (𝑥𝐴 → ∃*𝑦𝜑))
1210, 11mpbir 234 . . . . 5 ∃*𝑦(𝑥𝐴𝜑)
135, 12mpgbir 1832 . . . 4 Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)}
14 isarep2.1 . . . . 5 𝐴 ∈ V
1514funimaex 6627 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴) ∈ V)
1613, 15ax-mp 5 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)} “ 𝐴) ∈ V
174, 16eqeltri 2861 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴) ∈ V
1817isseti 3475 1 𝑤 𝑤 = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wal 1568   = wceq 1570  wex 1812  [wsb 2099  wcel 2146  ∃*wmo 2567  wral 3081  Vcvv 3457  {copab 5175  cres 5665  cima 5666  Fun wfun 6534
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-fun 6542
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator