Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1416 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj60 32942. 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 |
---|---|
bnj1416.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
bnj1416.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
bnj1416.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
bnj1416.4 | ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
bnj1416.5 | ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} |
bnj1416.6 | ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) |
bnj1416.7 | ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) |
bnj1416.8 | ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) |
bnj1416.9 | ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} |
bnj1416.10 | ⊢ 𝑃 = ∪ 𝐻 |
bnj1416.11 | ⊢ 𝑍 = 〈𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
bnj1416.12 | ⊢ 𝑄 = (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) |
bnj1416.28 | ⊢ (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅)) |
Ref | Expression |
---|---|
bnj1416 | ⊢ (𝜒 → dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1416.12 | . . . 4 ⊢ 𝑄 = (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) | |
2 | 1 | dmeqi 5802 | . . 3 ⊢ dom 𝑄 = dom (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) |
3 | dmun 5808 | . . 3 ⊢ dom (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) = (dom 𝑃 ∪ dom {〈𝑥, (𝐺‘𝑍)〉}) | |
4 | fvex 6769 | . . . . 5 ⊢ (𝐺‘𝑍) ∈ V | |
5 | 4 | dmsnop 6108 | . . . 4 ⊢ dom {〈𝑥, (𝐺‘𝑍)〉} = {𝑥} |
6 | 5 | uneq2i 4090 | . . 3 ⊢ (dom 𝑃 ∪ dom {〈𝑥, (𝐺‘𝑍)〉}) = (dom 𝑃 ∪ {𝑥}) |
7 | 2, 3, 6 | 3eqtri 2770 | . 2 ⊢ dom 𝑄 = (dom 𝑃 ∪ {𝑥}) |
8 | bnj1416.28 | . . . 4 ⊢ (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅)) | |
9 | 8 | uneq1d 4092 | . . 3 ⊢ (𝜒 → (dom 𝑃 ∪ {𝑥}) = ( trCl(𝑥, 𝐴, 𝑅) ∪ {𝑥})) |
10 | uncom 4083 | . . 3 ⊢ ( trCl(𝑥, 𝐴, 𝑅) ∪ {𝑥}) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) | |
11 | 9, 10 | eqtrdi 2795 | . 2 ⊢ (𝜒 → (dom 𝑃 ∪ {𝑥}) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) |
12 | 7, 11 | syl5eq 2791 | 1 ⊢ (𝜒 → dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∃wex 1783 ∈ wcel 2108 {cab 2715 ≠ wne 2942 ∀wral 3063 ∃wrex 3064 {crab 3067 [wsbc 3711 ∪ cun 3881 ⊆ wss 3883 ∅c0 4253 {csn 4558 〈cop 4564 ∪ cuni 4836 class class class wbr 5070 dom cdm 5580 ↾ cres 5582 Fn wfn 6413 ‘cfv 6418 predc-bnj14 32567 FrSe w-bnj15 32571 trClc-bnj18 32573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-dm 5590 df-iota 6376 df-fv 6426 |
This theorem is referenced by: bnj1312 32938 |
Copyright terms: Public domain | W3C validator |