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 30332. 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 2902 | . 2 ⊢ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
2 | bnj1083.8 | . . 3 ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
3 | 2 | abeq2i 2722 | . 2 ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
4 | bnj1083.3 | . . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
5 | bnj252 30022 | . . . 4 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
6 | 4, 5 | bitri 263 | . . 3 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) |
7 | 6 | exbii 1764 | . 2 ⊢ (∃𝑛𝜒 ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) |
8 | 1, 3, 7 | 3bitr4i 291 | 1 ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛𝜒) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∃wex 1695 ∈ wcel 1977 {cab 2596 ∃wrex 2897 Fn wfn 5799 ∧ w-bnj17 30005 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-12 2034 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-rex 2902 df-bnj17 30006 |
This theorem is referenced by: bnj1121 30307 bnj1145 30315 |
Copyright terms: Public domain | W3C validator |