Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1371 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj60 32231. 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 |
---|---|
bnj1371.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
bnj1371.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
bnj1371.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
bnj1371.4 | ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
bnj1371.5 | ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} |
bnj1371.6 | ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) |
bnj1371.7 | ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) |
bnj1371.8 | ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) |
bnj1371.9 | ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} |
bnj1371.10 | ⊢ 𝑃 = ∪ 𝐻 |
bnj1371.11 | ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
Ref | Expression |
---|---|
bnj1371 | ⊢ (𝑓 ∈ 𝐻 → Fun 𝑓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1371.9 | . . . . . . 7 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} | |
2 | 1 | bnj1436 32010 | . . . . . 6 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′) |
3 | rexex 3237 | . . . . . 6 ⊢ (∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′ → ∃𝑦𝜏′) | |
4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦𝜏′) |
5 | bnj1371.11 | . . . . . 6 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) | |
6 | 5 | exbii 1839 | . . . . 5 ⊢ (∃𝑦𝜏′ ↔ ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
7 | 4, 6 | sylib 219 | . . . 4 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
8 | exsimpl 1860 | . . . 4 ⊢ (∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∃𝑦 𝑓 ∈ 𝐶) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 𝑓 ∈ 𝐶) |
10 | bnj1371.3 | . . . . . . 7 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
11 | 10 | abeq2i 2945 | . . . . . 6 ⊢ (𝑓 ∈ 𝐶 ↔ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))) |
12 | 11 | bnj1238 31977 | . . . . 5 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 𝑓 Fn 𝑑) |
13 | fnfun 6446 | . . . . 5 ⊢ (𝑓 Fn 𝑑 → Fun 𝑓) | |
14 | 12, 13 | bnj31 31888 | . . . 4 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 Fun 𝑓) |
15 | 14 | bnj1265 31983 | . . 3 ⊢ (𝑓 ∈ 𝐶 → Fun 𝑓) |
16 | 9, 15 | bnj593 31915 | . 2 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦Fun 𝑓) |
17 | 16 | bnj937 31942 | 1 ⊢ (𝑓 ∈ 𝐻 → Fun 𝑓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∃wex 1771 ∈ wcel 2105 {cab 2796 ≠ wne 3013 ∀wral 3135 ∃wrex 3136 {crab 3139 [wsbc 3769 ∪ cun 3931 ⊆ wss 3933 ∅c0 4288 {csn 4557 〈cop 4563 ∪ cuni 4830 class class class wbr 5057 dom cdm 5548 ↾ cres 5550 Fun wfun 6342 Fn wfn 6343 ‘cfv 6348 predc-bnj14 31857 FrSe w-bnj15 31861 trClc-bnj18 31863 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-tru 1531 df-ex 1772 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-ral 3140 df-rex 3141 df-fn 6351 |
This theorem is referenced by: bnj1384 32201 |
Copyright terms: Public domain | W3C validator |