| 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 35199. 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 5854 | . . 3 ⊢ dom 𝑄 = dom (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) |
| 3 | dmun 5860 | . . 3 ⊢ dom (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) = (dom 𝑃 ∪ dom {〈𝑥, (𝐺‘𝑍)〉}) | |
| 4 | fvex 6848 | . . . . 5 ⊢ (𝐺‘𝑍) ∈ V | |
| 5 | 4 | dmsnop 6175 | . . . 4 ⊢ dom {〈𝑥, (𝐺‘𝑍)〉} = {𝑥} |
| 6 | 5 | uneq2i 4118 | . . 3 ⊢ (dom 𝑃 ∪ dom {〈𝑥, (𝐺‘𝑍)〉}) = (dom 𝑃 ∪ {𝑥}) |
| 7 | 2, 3, 6 | 3eqtri 2764 | . 2 ⊢ dom 𝑄 = (dom 𝑃 ∪ {𝑥}) |
| 8 | bnj1416.28 | . . . 4 ⊢ (𝜒 → dom 𝑃 = trCl(𝑥, 𝐴, 𝑅)) | |
| 9 | 8 | uneq1d 4120 | . . 3 ⊢ (𝜒 → (dom 𝑃 ∪ {𝑥}) = ( trCl(𝑥, 𝐴, 𝑅) ∪ {𝑥})) |
| 10 | uncom 4111 | . . 3 ⊢ ( trCl(𝑥, 𝐴, 𝑅) ∪ {𝑥}) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) | |
| 11 | 9, 10 | eqtrdi 2788 | . 2 ⊢ (𝜒 → (dom 𝑃 ∪ {𝑥}) = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) |
| 12 | 7, 11 | eqtrid 2784 | 1 ⊢ (𝜒 → dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∃wex 1781 ∈ wcel 2114 {cab 2715 ≠ wne 2933 ∀wral 3052 ∃wrex 3061 {crab 3400 [wsbc 3741 ∪ cun 3900 ⊆ wss 3902 ∅c0 4286 {csn 4581 〈cop 4587 ∪ cuni 4864 class class class wbr 5099 dom cdm 5625 ↾ cres 5627 Fn wfn 6488 ‘cfv 6493 predc-bnj14 34825 FrSe w-bnj15 34829 trClc-bnj18 34831 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pr 5378 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4287 df-if 4481 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-br 5100 df-dm 5635 df-iota 6449 df-fv 6501 |
| This theorem is referenced by: bnj1312 35195 |
| Copyright terms: Public domain | W3C validator |