| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj900 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj69 35506. 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 |
|---|---|
| bnj900.3 | ⊢ 𝐷 = (ω ∖ {∅}) |
| bnj900.4 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
| Ref | Expression |
|---|---|
| bnj900 | ⊢ (𝑓 ∈ 𝐵 → ∅ ∈ dom 𝑓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj900.4 | . . . . . 6 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
| 2 | 1 | bnj1436 35335 | . . . . 5 ⊢ (𝑓 ∈ 𝐵 → ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
| 3 | simp1 1154 | . . . . . 6 ⊢ ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) → 𝑓 Fn 𝑛) | |
| 4 | 3 | reximi 3102 | . . . . 5 ⊢ (∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) → ∃𝑛 ∈ 𝐷 𝑓 Fn 𝑛) |
| 5 | fndm 6639 | . . . . . 6 ⊢ (𝑓 Fn 𝑛 → dom 𝑓 = 𝑛) | |
| 6 | 5 | reximi 3102 | . . . . 5 ⊢ (∃𝑛 ∈ 𝐷 𝑓 Fn 𝑛 → ∃𝑛 ∈ 𝐷 dom 𝑓 = 𝑛) |
| 7 | 2, 4, 6 | 3syl 19 | . . . 4 ⊢ (𝑓 ∈ 𝐵 → ∃𝑛 ∈ 𝐷 dom 𝑓 = 𝑛) |
| 8 | 7 | bnj1196 35290 | . . 3 ⊢ (𝑓 ∈ 𝐵 → ∃𝑛(𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛)) |
| 9 | nfre1 3289 | . . . . . . 7 ⊢ Ⅎ𝑛∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) | |
| 10 | 9 | nfab 2930 | . . . . . 6 ⊢ Ⅎ𝑛{𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
| 11 | 1, 10 | nfcxfr 2922 | . . . . 5 ⊢ Ⅎ𝑛𝐵 |
| 12 | 11 | nfcri 2916 | . . . 4 ⊢ Ⅎ𝑛 𝑓 ∈ 𝐵 |
| 13 | 12 | 19.37 2270 | . . 3 ⊢ (∃𝑛(𝑓 ∈ 𝐵 → (𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛)) ↔ (𝑓 ∈ 𝐵 → ∃𝑛(𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛))) |
| 14 | 8, 13 | mpbir 234 | . 2 ⊢ ∃𝑛(𝑓 ∈ 𝐵 → (𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛)) |
| 15 | nfv 1947 | . . . 4 ⊢ Ⅎ𝑛∅ ∈ dom 𝑓 | |
| 16 | 12, 15 | nfim 1929 | . . 3 ⊢ Ⅎ𝑛(𝑓 ∈ 𝐵 → ∅ ∈ dom 𝑓) |
| 17 | bnj900.3 | . . . . . 6 ⊢ 𝐷 = (ω ∖ {∅}) | |
| 18 | 17 | bnj529 35238 | . . . . 5 ⊢ (𝑛 ∈ 𝐷 → ∅ ∈ 𝑛) |
| 19 | eleq2 2851 | . . . . . 6 ⊢ (dom 𝑓 = 𝑛 → (∅ ∈ dom 𝑓 ↔ ∅ ∈ 𝑛)) | |
| 20 | 19 | biimparc 485 | . . . . 5 ⊢ ((∅ ∈ 𝑛 ∧ dom 𝑓 = 𝑛) → ∅ ∈ dom 𝑓) |
| 21 | 18, 20 | sylan 592 | . . . 4 ⊢ ((𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛) → ∅ ∈ dom 𝑓) |
| 22 | 21 | imim2i 17 | . . 3 ⊢ ((𝑓 ∈ 𝐵 → (𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛)) → (𝑓 ∈ 𝐵 → ∅ ∈ dom 𝑓)) |
| 23 | 16, 22 | exlimi 2255 | . 2 ⊢ (∃𝑛(𝑓 ∈ 𝐵 → (𝑛 ∈ 𝐷 ∧ dom 𝑓 = 𝑛)) → (𝑓 ∈ 𝐵 → ∅ ∈ dom 𝑓)) |
| 24 | 14, 23 | ax-mp 5 | 1 ⊢ (𝑓 ∈ 𝐵 → ∅ ∈ dom 𝑓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2145 {cab 2740 ∃wrex 3088 ∖ cdif 3899 ∅c0 4282 {csn 4587 dom cdm 5659 Fn wfn 6532 ωcom 7865 |
| 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 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-tr 5217 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-ord 6364 df-on 6365 df-fn 6540 df-om 7866 |
| This theorem is used by: bnj906 35426 |
| Copyright terms: Public domain | W3C validator |