| Intuitionistic Logic Explorer | 
      
      
      < Previous  
      Next >
      
       Nearby theorems  | 
  ||
| Mirrors > Home > ILE Home > Th. List > isarep2 | GIF version | ||
| 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 5343. (Contributed by NM, 26-Oct-2006.) | 
| Ref | Expression | 
|---|---|
| isarep2.1 | ⊢ 𝐴 ∈ V | 
| isarep2.2 | ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧) | 
| Ref | Expression | 
|---|---|
| isarep2 | ⊢ ∃𝑤 𝑤 = ({〈𝑥, 𝑦〉 ∣ 𝜑} “ 𝐴) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | resima 4979 | . . . 4 ⊢ (({〈𝑥, 𝑦〉 ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({〈𝑥, 𝑦〉 ∣ 𝜑} “ 𝐴) | |
| 2 | resopab 4990 | . . . . 5 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} ↾ 𝐴) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
| 3 | 2 | imaeq1i 5006 | . . . 4 ⊢ (({〈𝑥, 𝑦〉 ∣ 𝜑} ↾ 𝐴) “ 𝐴) = ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴) | 
| 4 | 1, 3 | eqtr3i 2219 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} “ 𝐴) = ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴) | 
| 5 | funopab 5293 | . . . . 5 ⊢ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 6 | isarep2.2 | . . . . . . . 8 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧) | |
| 7 | 6 | rspec 2549 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧)) | 
| 8 | nfv 1542 | . . . . . . . 8 ⊢ Ⅎ𝑧𝜑 | |
| 9 | 8 | mo3 2099 | . . . . . . 7 ⊢ (∃*𝑦𝜑 ↔ ∀𝑦∀𝑧((𝜑 ∧ [𝑧 / 𝑦]𝜑) → 𝑦 = 𝑧)) | 
| 10 | 7, 9 | sylibr 134 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ∃*𝑦𝜑) | 
| 11 | moanimv 2120 | . . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
| 12 | 10, 11 | mpbir 146 | . . . . 5 ⊢ ∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) | 
| 13 | 5, 12 | mpgbir 1467 | . . . 4 ⊢ Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | 
| 14 | isarep2.1 | . . . . 5 ⊢ 𝐴 ∈ V | |
| 15 | 14 | funimaex 5343 | . . . 4 ⊢ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} → ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴) ∈ V) | 
| 16 | 13, 15 | ax-mp 5 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} “ 𝐴) ∈ V | 
| 17 | 4, 16 | eqeltri 2269 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ 𝜑} “ 𝐴) ∈ V | 
| 18 | 17 | isseti 2771 | 1 ⊢ ∃𝑤 𝑤 = ({〈𝑥, 𝑦〉 ∣ 𝜑} “ 𝐴) | 
| Colors of variables: wff set class | 
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1362 = wceq 1364 ∃wex 1506 [wsb 1776 ∃*wmo 2046 ∈ wcel 2167 ∀wral 2475 Vcvv 2763 {copab 4093 ↾ cres 4665 “ cima 4666 Fun wfun 5252 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-coll 4148 ax-sep 4151 ax-pow 4207 ax-pr 4242 | 
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-un 3161 df-in 3163 df-ss 3170 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-br 4034 df-opab 4095 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-rn 4674 df-res 4675 df-ima 4676 df-fun 5260 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |