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

Theorem isarep2 6659
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 6657. (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 6074 . . . 4 (({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
2 resopab 6044 . . . . 5 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
32imaeq1i 6067 . . . 4 (({⟨𝑥, 𝑦⟩ ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴)
41, 3eqtr3i 2788 . . 3 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴)
5 funopab 6603 . . . . 5 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑))
6 isarep2.2 . . . . . . . 8 ∀𝑥 ∈ 𝐴 ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧)
76rspec 3257 . . . . . . 7 (𝑥 ∈ 𝐴 → ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧))
8 nfv 1949 . . . . . . . 8 Ⅎ𝑧𝜑
98mo3 2592 . . . . . . 7 (∃*𝑦𝜑 ↔ ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧))
107, 9sylibr 237 . . . . . 6 (𝑥 ∈ 𝐴 → ∃*𝑦𝜑)
11 moanimv 2647 . . . . . 6 (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦𝜑))
1210, 11mpbir 234 . . . . 5 ∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
135, 12mpgbir 1832 . . . 4 Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}
14 isarep2.1 . . . . 5 𝐴 ∈ V
1514funimaex 6657 . . . 4 (Fun {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴) ∈ V)
1613, 15ax-mp 5 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴) ∈ V
174, 16eqeltri 2860 . 2 ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴) ∈ V
1817isseti 3472 1 ∃𝑤 𝑤 = ({⟨𝑥, 𝑦⟩ ∣ 𝜑} “ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  [wsb 2101   ∈ wcel 2147  ∃*wmo 2565  ∀wral 3080  Vcvv 3454  {copab 5173   ↾ cres 5660   “ cima 5661  Fun wfun 6560
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-pr 5398
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 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-fun 6568
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator