| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1083 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj69 35407. 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 |
|---|---|
| bnj1083.3 | ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
| bnj1083.8 | ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
| Ref | Expression |
|---|---|
| bnj1083 | ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛𝜒) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 3089 | . 2 ⊢ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
| 2 | bnj1083.8 | . . 3 ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
| 3 | 2 | eqabri 2904 | . 2 ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
| 4 | bnj1083.3 | . . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
| 5 | bnj252 35101 | . . . 4 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
| 6 | 4, 5 | bitri 278 | . . 3 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) |
| 7 | 6 | exbii 1877 | . 2 ⊢ (∃𝑛𝜒 ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) |
| 8 | 1, 3, 7 | 3bitr4i 306 | 1 ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛𝜒) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∃wex 1808 ∈ wcel 2142 {cab 2740 ∃wrex 3088 Fn wfn 6531 ∧ w-bnj17 35084 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-12 2212 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-3an 1104 df-tru 1572 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-rex 3089 df-bnj17 35085 |
| This theorem is used by: bnj1121 35382 bnj1145 35390 |
| Copyright terms: Public domain | W3C validator |