| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1373 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj60 35759. 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 |
|---|---|
| bnj1373.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
| bnj1373.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| bnj1373.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
| bnj1373.4 | ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| bnj1373.5 | ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) |
| Ref | Expression |
|---|---|
| bnj1373 | ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj1373.5 | . 2 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) | |
| 2 | bnj1373.3 | . . . . . . 7 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
| 3 | bnj1373.1 | . . . . . . . 8 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} | |
| 4 | 3 | bnj1309 35719 | . . . . . . 7 ⊢ (𝑓 ∈ 𝐵 → ∀𝑥 𝑓 ∈ 𝐵) |
| 5 | 2, 4 | bnj1307 35720 | . . . . . 6 ⊢ (𝑓 ∈ 𝐶 → ∀𝑥 𝑓 ∈ 𝐶) |
| 6 | 5 | bnj1351 35523 | . . . . 5 ⊢ ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∀𝑥(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 7 | 6 | nf5i 2186 | . . . 4 ⊢ Ⅎ𝑥(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) |
| 8 | bnj1373.4 | . . . . 5 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) | |
| 9 | sneq 4594 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦}) | |
| 10 | bnj1318 35722 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → trCl(𝑥, 𝐴, 𝑅) = trCl(𝑦, 𝐴, 𝑅)) | |
| 11 | 9, 10 | uneq12d 4171 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) |
| 12 | 11 | eqeq2d 2774 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 13 | 12 | anbi2d 642 | . . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))) |
| 14 | 8, 13 | bitrid 286 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))) |
| 15 | 7, 14 | sbciegf 3780 | . . 3 ⊢ (𝑦 ∈ V → ([𝑦 / 𝑥]𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))) |
| 16 | 15 | elv 3459 | . 2 ⊢ ([𝑦 / 𝑥]𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 17 | 1, 16 | bitri 278 | 1 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {cab 2741 ∀wral 3080 ∃wrex 3090 Vcvv 3454 [wsbc 3742 ⊆ wss 3900 ∪ cun 4152 {csn 4588 〈cop 4838 dom cdm 5655 ↾ cres 5657 Fn wfn 6550 ‘cfv 6555 predc-bnj14 35386 trClc-bnj18 35392 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-iun 4956 df-br 5107 df-bnj14 35387 df-bnj18 35393 |
| This theorem is used by: bnj1374 35728 bnj1384 35729 bnj1398 35731 bnj1450 35747 bnj1489 35753 |
| Copyright terms: Public domain | W3C validator |