| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1514 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj1500 35426. 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 |
|---|---|
| bnj1514.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
| bnj1514.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| bnj1514.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
| Ref | Expression |
|---|---|
| bnj1514 | ⊢ (𝑓 ∈ 𝐶 → ∀𝑥 ∈ dom 𝑓(𝑓‘𝑥) = (𝐺‘𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj1514.3 | . . . . 5 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
| 2 | 1 | bnj1436 35197 | . . . 4 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))) |
| 3 | df-rex 3097 | . . . . 5 ⊢ (∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ ∃𝑑(𝑑 ∈ 𝐵 ∧ (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)))) | |
| 4 | 3anass 1109 | . . . . 5 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ (𝑑 ∈ 𝐵 ∧ (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)))) | |
| 5 | 3, 4 | bnj133 35086 | . . . 4 ⊢ (∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ ∃𝑑(𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))) |
| 6 | 2, 5 | sylib 221 | . . 3 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑(𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))) |
| 7 | simp3 1154 | . . . 4 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) → ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) | |
| 8 | fndm 6642 | . . . . 5 ⊢ (𝑓 Fn 𝑑 → dom 𝑓 = 𝑑) | |
| 9 | 8 | 3ad2ant2 1150 | . . . 4 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) → dom 𝑓 = 𝑑) |
| 10 | 7, 9 | raleqtrrdv 3334 | . . 3 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) → ∀𝑥 ∈ dom 𝑓(𝑓‘𝑥) = (𝐺‘𝑌)) |
| 11 | 6, 10 | bnj593 35104 | . 2 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑∀𝑥 ∈ dom 𝑓(𝑓‘𝑥) = (𝐺‘𝑌)) |
| 12 | 11 | bnj937 35130 | 1 ⊢ (𝑓 ∈ 𝐶 → ∀𝑥 ∈ dom 𝑓(𝑓‘𝑥) = (𝐺‘𝑌)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∃wex 1807 ∈ wcel 2150 {cab 2748 ∀wral 3086 ∃wrex 3096 ⊆ wss 3913 〈cop 4600 dom cdm 5665 ↾ cres 5667 Fn wfn 6535 ‘cfv 6540 predc-bnj14 35047 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-12 2220 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-3an 1103 df-tru 1571 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ral 3087 df-rex 3097 df-fn 6543 |
| This theorem is referenced by: bnj1501 35425 |
| Copyright terms: Public domain | W3C validator |