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 33028. 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 32805 | . . . . . 6 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′) |
3 | rexex 3169 | . . . . . 6 ⊢ (∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′ → ∃𝑦𝜏′) | |
4 | 2, 3 | syl 17 | . . . . 5 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦𝜏′) |
5 | bnj1371.11 | . . . . . 6 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) | |
6 | 5 | exbii 1850 | . . . . 5 ⊢ (∃𝑦𝜏′ ↔ ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
7 | 4, 6 | sylib 217 | . . . 4 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
8 | exsimpl 1871 | . . . 4 ⊢ (∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∃𝑦 𝑓 ∈ 𝐶) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 𝑓 ∈ 𝐶) |
10 | bnj1371.3 | . . . . . . 7 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
11 | 10 | abeq2i 2875 | . . . . . 6 ⊢ (𝑓 ∈ 𝐶 ↔ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))) |
12 | 11 | bnj1238 32772 | . . . . 5 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 𝑓 Fn 𝑑) |
13 | fnfun 6526 | . . . . 5 ⊢ (𝑓 Fn 𝑑 → Fun 𝑓) | |
14 | 12, 13 | bnj31 32684 | . . . 4 ⊢ (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 Fun 𝑓) |
15 | 14 | bnj1265 32778 | . . 3 ⊢ (𝑓 ∈ 𝐶 → Fun 𝑓) |
16 | 9, 15 | bnj593 32711 | . 2 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦Fun 𝑓) |
17 | 16 | bnj937 32737 | 1 ⊢ (𝑓 ∈ 𝐻 → Fun 𝑓) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∃wex 1782 ∈ wcel 2106 {cab 2715 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 {crab 3068 [wsbc 3716 ∪ cun 3885 ⊆ wss 3887 ∅c0 4257 {csn 4562 〈cop 4568 ∪ cuni 4840 class class class wbr 5074 dom cdm 5585 ↾ cres 5587 Fun wfun 6421 Fn wfn 6422 ‘cfv 6427 predc-bnj14 32653 FrSe w-bnj15 32657 trClc-bnj18 32659 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rex 3070 df-fn 6430 |
This theorem is referenced by: bnj1384 32998 |
Copyright terms: Public domain | W3C validator |