Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1374 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj60 32334. 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 |
---|---|
bnj1374.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
bnj1374.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
bnj1374.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
bnj1374.4 | ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
bnj1374.5 | ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} |
bnj1374.6 | ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) |
bnj1374.7 | ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) |
bnj1374.8 | ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) |
bnj1374.9 | ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} |
Ref | Expression |
---|---|
bnj1374 | ⊢ (𝑓 ∈ 𝐻 → 𝑓 ∈ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1374.9 | . . . . . 6 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} | |
2 | 1 | bnj1436 32111 | . . . . 5 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′) |
3 | rexex 3240 | . . . . 5 ⊢ (∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′ → ∃𝑦𝜏′) | |
4 | 2, 3 | syl 17 | . . . 4 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦𝜏′) |
5 | bnj1374.1 | . . . . . 6 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} | |
6 | bnj1374.2 | . . . . . 6 ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
7 | bnj1374.3 | . . . . . 6 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
8 | bnj1374.4 | . . . . . 6 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) | |
9 | bnj1374.8 | . . . . . 6 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) | |
10 | 5, 6, 7, 8, 9 | bnj1373 32302 | . . . . 5 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
11 | 10 | exbii 1848 | . . . 4 ⊢ (∃𝑦𝜏′ ↔ ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
12 | 4, 11 | sylib 220 | . . 3 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
13 | exsimpl 1869 | . . 3 ⊢ (∃𝑦(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∃𝑦 𝑓 ∈ 𝐶) | |
14 | 12, 13 | syl 17 | . 2 ⊢ (𝑓 ∈ 𝐻 → ∃𝑦 𝑓 ∈ 𝐶) |
15 | 14 | bnj937 32043 | 1 ⊢ (𝑓 ∈ 𝐻 → 𝑓 ∈ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∃wex 1780 ∈ wcel 2114 {cab 2799 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 {crab 3142 [wsbc 3772 ∪ cun 3934 ⊆ wss 3936 ∅c0 4291 {csn 4567 〈cop 4573 class class class wbr 5066 dom cdm 5555 ↾ cres 5557 Fn wfn 6350 ‘cfv 6355 predc-bnj14 31958 FrSe w-bnj15 31962 trClc-bnj18 31964 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-iun 4921 df-br 5067 df-bnj14 31959 df-bnj18 31965 |
This theorem is referenced by: bnj1384 32304 |
Copyright terms: Public domain | W3C validator |