|   | 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 35025. 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 3070 | . 2 ⊢ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
| 2 | bnj1083.8 | . . 3 ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
| 3 | 2 | eqabri 2884 | . 2 ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | 
| 4 | bnj1083.3 | . . . 4 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
| 5 | bnj252 34718 | . . . 4 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
| 6 | 4, 5 | bitri 275 | . . 3 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | 
| 7 | 6 | exbii 1847 | . 2 ⊢ (∃𝑛𝜒 ↔ ∃𝑛(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | 
| 8 | 1, 3, 7 | 3bitr4i 303 | 1 ⊢ (𝑓 ∈ 𝐾 ↔ ∃𝑛𝜒) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∃wex 1778 ∈ wcel 2107 {cab 2713 ∃wrex 3069 Fn wfn 6555 ∧ w-bnj17 34701 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-12 2176 ax-ext 2707 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-3an 1088 df-tru 1542 df-ex 1779 df-sb 2064 df-clab 2714 df-cleq 2728 df-clel 2815 df-rex 3070 df-bnj17 34702 | 
| This theorem is referenced by: bnj1121 35000 bnj1145 35008 | 
| Copyright terms: Public domain | W3C validator |