| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj873 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj69 35527. 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). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj873.4 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
| bnj873.7 | ⊢ (𝜑′ ↔ [𝑔 / 𝑓]𝜑) |
| bnj873.8 | ⊢ (𝜓′ ↔ [𝑔 / 𝑓]𝜓) |
| Ref | Expression |
|---|---|
| bnj873 | ⊢ 𝐵 = {𝑔 ∣ ∃𝑛 ∈ 𝐷 (𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj873.4 | . 2 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
| 2 | nfv 1947 | . . 3 ⊢ Ⅎ𝑔∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) | |
| 3 | nfcv 2924 | . . . 4 ⊢ Ⅎ𝑓𝐷 | |
| 4 | nfv 1947 | . . . . 5 ⊢ Ⅎ𝑓 𝑔 Fn 𝑛 | |
| 5 | bnj873.7 | . . . . . 6 ⊢ (𝜑′ ↔ [𝑔 / 𝑓]𝜑) | |
| 6 | nfsbc1v 3762 | . . . . . 6 ⊢ Ⅎ𝑓[𝑔 / 𝑓]𝜑 | |
| 7 | 5, 6 | nfxfr 1886 | . . . . 5 ⊢ Ⅎ𝑓𝜑′ |
| 8 | bnj873.8 | . . . . . 6 ⊢ (𝜓′ ↔ [𝑔 / 𝑓]𝜓) | |
| 9 | nfsbc1v 3762 | . . . . . 6 ⊢ Ⅎ𝑓[𝑔 / 𝑓]𝜓 | |
| 10 | 8, 9 | nfxfr 1886 | . . . . 5 ⊢ Ⅎ𝑓𝜓′ |
| 11 | 4, 7, 10 | nf3an 1934 | . . . 4 ⊢ Ⅎ𝑓(𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′) |
| 12 | 3, 11 | nfrexw 3312 | . . 3 ⊢ Ⅎ𝑓∃𝑛 ∈ 𝐷 (𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′) |
| 13 | fneq1 6627 | . . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝑛 ↔ 𝑔 Fn 𝑛)) | |
| 14 | sbceq1a 3753 | . . . . . 6 ⊢ (𝑓 = 𝑔 → (𝜑 ↔ [𝑔 / 𝑓]𝜑)) | |
| 15 | 14, 5 | bitr4di 292 | . . . . 5 ⊢ (𝑓 = 𝑔 → (𝜑 ↔ 𝜑′)) |
| 16 | sbceq1a 3753 | . . . . . 6 ⊢ (𝑓 = 𝑔 → (𝜓 ↔ [𝑔 / 𝑓]𝜓)) | |
| 17 | 16, 8 | bitr4di 292 | . . . . 5 ⊢ (𝑓 = 𝑔 → (𝜓 ↔ 𝜓′)) |
| 18 | 13, 15, 17 | 3anbi123d 1464 | . . . 4 ⊢ (𝑓 = 𝑔 → ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′))) |
| 19 | 18 | rexbidv 3188 | . . 3 ⊢ (𝑓 = 𝑔 → (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛 ∈ 𝐷 (𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′))) |
| 20 | 2, 12, 19 | cbvabw 2833 | . 2 ⊢ {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} = {𝑔 ∣ ∃𝑛 ∈ 𝐷 (𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′)} |
| 21 | 1, 20 | eqtri 2785 | 1 ⊢ 𝐵 = {𝑔 ∣ ∃𝑛 ∈ 𝐷 (𝑔 Fn 𝑛 ∧ 𝜑′ ∧ 𝜓′)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ w3a 1103 = wceq 1570 {cab 2740 ∃wrex 3088 [wsbc 3742 Fn wfn 6532 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 |
| 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-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-fun 6539 df-fn 6540 |
| This theorem is used by: bnj849 35442 bnj893 35445 |
| Copyright terms: Public domain | W3C validator |