| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj985 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj69 35307. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). See bnj985v 35250 for a version with more disjoint variable conditions, not requiring ax-13 2405. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj985.3 | ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
| bnj985.6 | ⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒) |
| bnj985.9 | ⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′) |
| bnj985.11 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
| bnj985.13 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑛, 𝐶〉}) |
| Ref | Expression |
|---|---|
| bnj985 | ⊢ (𝐺 ∈ 𝐵 ↔ ∃𝑝𝜒″) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj985.13 | . . . 4 ⊢ 𝐺 = (𝑓 ∪ {〈𝑛, 𝐶〉}) | |
| 2 | 1 | bnj918 35064 | . . 3 ⊢ 𝐺 ∈ V |
| 3 | bnj985.3 | . . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
| 4 | bnj985.11 | . . . 4 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
| 5 | 3, 4 | bnj984 35249 | . . 3 ⊢ (𝐺 ∈ V → (𝐺 ∈ 𝐵 ↔ [𝐺 / 𝑓]∃𝑛𝜒)) |
| 6 | 2, 5 | ax-mp 5 | . 2 ⊢ (𝐺 ∈ 𝐵 ↔ [𝐺 / 𝑓]∃𝑛𝜒) |
| 7 | sbcex2 3806 | . . 3 ⊢ ([𝐺 / 𝑓]∃𝑝𝜒′ ↔ ∃𝑝[𝐺 / 𝑓]𝜒′) | |
| 8 | nfv 1936 | . . . . . . 7 ⊢ Ⅎ𝑝𝜒 | |
| 9 | 8 | sb8e 2551 | . . . . . 6 ⊢ (∃𝑛𝜒 ↔ ∃𝑝[𝑝 / 𝑛]𝜒) |
| 10 | sbsbc 3750 | . . . . . . 7 ⊢ ([𝑝 / 𝑛]𝜒 ↔ [𝑝 / 𝑛]𝜒) | |
| 11 | 10 | exbii 1870 | . . . . . 6 ⊢ (∃𝑝[𝑝 / 𝑛]𝜒 ↔ ∃𝑝[𝑝 / 𝑛]𝜒) |
| 12 | 9, 11 | bitri 277 | . . . . 5 ⊢ (∃𝑛𝜒 ↔ ∃𝑝[𝑝 / 𝑛]𝜒) |
| 13 | bnj985.6 | . . . . 5 ⊢ (𝜒′ ↔ [𝑝 / 𝑛]𝜒) | |
| 14 | 12, 13 | bnj133 35025 | . . . 4 ⊢ (∃𝑛𝜒 ↔ ∃𝑝𝜒′) |
| 15 | 14 | sbcbii 3802 | . . 3 ⊢ ([𝐺 / 𝑓]∃𝑛𝜒 ↔ [𝐺 / 𝑓]∃𝑝𝜒′) |
| 16 | bnj985.9 | . . . 4 ⊢ (𝜒″ ↔ [𝐺 / 𝑓]𝜒′) | |
| 17 | 16 | exbii 1870 | . . 3 ⊢ (∃𝑝𝜒″ ↔ ∃𝑝[𝐺 / 𝑓]𝜒′) |
| 18 | 7, 15, 17 | 3bitr4i 305 | . 2 ⊢ ([𝐺 / 𝑓]∃𝑛𝜒 ↔ ∃𝑝𝜒″) |
| 19 | 6, 18 | bitri 277 | 1 ⊢ (𝐺 ∈ 𝐵 ↔ ∃𝑝𝜒″) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ w3a 1099 = wceq 1562 ∃wex 1801 [wsb 2092 ∈ wcel 2144 {cab 2742 ∃wrex 3088 Vcvv 3456 [wsbc 3746 ∪ cun 3904 {csn 4584 〈cop 4590 Fn wfn 6518 ∧ w-bnj17 34984 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-13 2405 ax-ext 2736 ax-sep 5248 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-ex 1802 df-nf 1806 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-rex 3089 df-v 3458 df-sbc 3747 df-un 3911 df-ss 3923 df-sn 4585 df-pr 4587 df-uni 4868 df-bnj17 34985 |
| This theorem is referenced by: bnj1018g 35260 |
| Copyright terms: Public domain | W3C validator |