| 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 35244. 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 35204 | . . . . . . 7 ⊢ (𝑓 ∈ 𝐵 → ∀𝑥 𝑓 ∈ 𝐵) |
| 5 | 2, 4 | bnj1307 35205 | . . . . . 6 ⊢ (𝑓 ∈ 𝐶 → ∀𝑥 𝑓 ∈ 𝐶) |
| 6 | 5 | bnj1351 35008 | . . . . 5 ⊢ ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) → ∀𝑥(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 7 | 6 | nf5i 2152 | . . . 4 ⊢ Ⅎ𝑥(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) |
| 8 | bnj1373.4 | . . . . 5 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) | |
| 9 | sneq 4592 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → {𝑥} = {𝑦}) | |
| 10 | bnj1318 35207 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → trCl(𝑥, 𝐴, 𝑅) = trCl(𝑦, 𝐴, 𝑅)) | |
| 11 | 9, 10 | uneq12d 4123 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))) |
| 12 | 11 | eqeq2d 2748 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 13 | 12 | anbi2d 631 | . . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))) |
| 14 | 8, 13 | bitrid 283 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))) |
| 15 | 7, 14 | sbciegf 3781 | . . 3 ⊢ (𝑦 ∈ V → ([𝑦 / 𝑥]𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅))))) |
| 16 | 15 | elv 3447 | . 2 ⊢ ([𝑦 / 𝑥]𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 17 | 1, 16 | bitri 275 | 1 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {cab 2715 ∀wral 3052 ∃wrex 3062 Vcvv 3442 [wsbc 3742 ∪ cun 3901 ⊆ wss 3903 {csn 4582 〈cop 4588 dom cdm 5634 ↾ cres 5636 Fn wfn 6497 ‘cfv 6502 predc-bnj14 34871 trClc-bnj18 34877 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 |
| 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-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-iun 4950 df-br 5101 df-bnj14 34872 df-bnj18 34878 |
| This theorem is referenced by: bnj1374 35213 bnj1384 35214 bnj1398 35216 bnj1450 35232 bnj1489 35238 |
| Copyright terms: Public domain | W3C validator |