| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1384 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj60 35197. 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 |
|---|---|
| bnj1384.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
| bnj1384.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| bnj1384.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
| bnj1384.4 | ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| bnj1384.5 | ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} |
| bnj1384.6 | ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) |
| bnj1384.7 | ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) |
| bnj1384.8 | ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) |
| bnj1384.9 | ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} |
| bnj1384.10 | ⊢ 𝑃 = ∪ 𝐻 |
| Ref | Expression |
|---|---|
| bnj1384 | ⊢ (𝑅 FrSe 𝐴 → Fun 𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj1384.1 | . . . . 5 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} | |
| 2 | bnj1384.2 | . . . . 5 ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
| 3 | bnj1384.3 | . . . . 5 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
| 4 | bnj1384.4 | . . . . 5 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) | |
| 5 | bnj1384.5 | . . . . 5 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} | |
| 6 | bnj1384.6 | . . . . 5 ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) | |
| 7 | bnj1384.7 | . . . . 5 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) | |
| 8 | bnj1384.8 | . . . . 5 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) | |
| 9 | bnj1384.9 | . . . . 5 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} | |
| 10 | bnj1384.10 | . . . . 5 ⊢ 𝑃 = ∪ 𝐻 | |
| 11 | 1, 2, 3, 4, 8 | bnj1373 35165 | . . . . 5 ⊢ (𝜏′ ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑦} ∪ trCl(𝑦, 𝐴, 𝑅)))) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | bnj1371 35164 | . . . 4 ⊢ (𝑓 ∈ 𝐻 → Fun 𝑓) |
| 13 | 12 | rgen 3052 | . . 3 ⊢ ∀𝑓 ∈ 𝐻 Fun 𝑓 |
| 14 | id 22 | . . . . . 6 ⊢ (𝑅 FrSe 𝐴 → 𝑅 FrSe 𝐴) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | bnj1374 35166 | . . . . . 6 ⊢ (𝑓 ∈ 𝐻 → 𝑓 ∈ 𝐶) |
| 16 | nfab1 2899 | . . . . . . . . . 10 ⊢ Ⅎ𝑓{𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} | |
| 17 | 9, 16 | nfcxfr 2895 | . . . . . . . . 9 ⊢ Ⅎ𝑓𝐻 |
| 18 | 17 | nfcri 2889 | . . . . . . . 8 ⊢ Ⅎ𝑓 𝑔 ∈ 𝐻 |
| 19 | nfab1 2899 | . . . . . . . . . 10 ⊢ Ⅎ𝑓{𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
| 20 | 3, 19 | nfcxfr 2895 | . . . . . . . . 9 ⊢ Ⅎ𝑓𝐶 |
| 21 | 20 | nfcri 2889 | . . . . . . . 8 ⊢ Ⅎ𝑓 𝑔 ∈ 𝐶 |
| 22 | 18, 21 | nfim 1898 | . . . . . . 7 ⊢ Ⅎ𝑓(𝑔 ∈ 𝐻 → 𝑔 ∈ 𝐶) |
| 23 | eleq1w 2818 | . . . . . . . 8 ⊢ (𝑓 = 𝑔 → (𝑓 ∈ 𝐻 ↔ 𝑔 ∈ 𝐻)) | |
| 24 | eleq1w 2818 | . . . . . . . 8 ⊢ (𝑓 = 𝑔 → (𝑓 ∈ 𝐶 ↔ 𝑔 ∈ 𝐶)) | |
| 25 | 23, 24 | imbi12d 344 | . . . . . . 7 ⊢ (𝑓 = 𝑔 → ((𝑓 ∈ 𝐻 → 𝑓 ∈ 𝐶) ↔ (𝑔 ∈ 𝐻 → 𝑔 ∈ 𝐶))) |
| 26 | 22, 25, 15 | chvarfv 2246 | . . . . . 6 ⊢ (𝑔 ∈ 𝐻 → 𝑔 ∈ 𝐶) |
| 27 | eqid 2735 | . . . . . . 7 ⊢ (dom 𝑓 ∩ dom 𝑔) = (dom 𝑓 ∩ dom 𝑔) | |
| 28 | 1, 2, 3, 27 | bnj1326 35161 | . . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑓 ∈ 𝐶 ∧ 𝑔 ∈ 𝐶) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔))) |
| 29 | 14, 15, 26, 28 | syl3an 1161 | . . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑓 ∈ 𝐻 ∧ 𝑔 ∈ 𝐻) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔))) |
| 30 | 29 | 3expib 1123 | . . . 4 ⊢ (𝑅 FrSe 𝐴 → ((𝑓 ∈ 𝐻 ∧ 𝑔 ∈ 𝐻) → (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))) |
| 31 | 30 | ralrimivv 3176 | . . 3 ⊢ (𝑅 FrSe 𝐴 → ∀𝑓 ∈ 𝐻 ∀𝑔 ∈ 𝐻 (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔))) |
| 32 | biid 261 | . . . 4 ⊢ (∀𝑓 ∈ 𝐻 Fun 𝑓 ↔ ∀𝑓 ∈ 𝐻 Fun 𝑓) | |
| 33 | biid 261 | . . . 4 ⊢ ((∀𝑓 ∈ 𝐻 Fun 𝑓 ∧ ∀𝑓 ∈ 𝐻 ∀𝑔 ∈ 𝐻 (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔))) ↔ (∀𝑓 ∈ 𝐻 Fun 𝑓 ∧ ∀𝑓 ∈ 𝐻 ∀𝑔 ∈ 𝐻 (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔)))) | |
| 34 | 9 | bnj1317 34956 | . . . 4 ⊢ (𝑧 ∈ 𝐻 → ∀𝑓 𝑧 ∈ 𝐻) |
| 35 | 32, 27, 33, 34 | bnj1386 34968 | . . 3 ⊢ ((∀𝑓 ∈ 𝐻 Fun 𝑓 ∧ ∀𝑓 ∈ 𝐻 ∀𝑔 ∈ 𝐻 (𝑓 ↾ (dom 𝑓 ∩ dom 𝑔)) = (𝑔 ↾ (dom 𝑓 ∩ dom 𝑔))) → Fun ∪ 𝐻) |
| 36 | 13, 31, 35 | sylancr 588 | . 2 ⊢ (𝑅 FrSe 𝐴 → Fun ∪ 𝐻) |
| 37 | 10 | funeqi 6512 | . 2 ⊢ (Fun 𝑃 ↔ Fun ∪ 𝐻) |
| 38 | 36, 37 | sylibr 234 | 1 ⊢ (𝑅 FrSe 𝐴 → Fun 𝑃) |
| 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 2713 ≠ wne 2931 ∀wral 3050 ∃wrex 3059 {crab 3398 [wsbc 3739 ∪ cun 3898 ∩ cin 3899 ⊆ wss 3900 ∅c0 4284 {csn 4579 〈cop 4585 ∪ cuni 4862 class class class wbr 5097 dom cdm 5623 ↾ cres 5625 Fun wfun 6485 Fn wfn 6486 ‘cfv 6491 predc-bnj14 34823 FrSe w-bnj15 34827 trClc-bnj18 34829 |
| 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 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-reg 9499 ax-inf2 9552 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-om 7809 df-1o 8397 df-bnj17 34822 df-bnj14 34824 df-bnj13 34826 df-bnj15 34828 df-bnj18 34830 df-bnj19 34832 |
| This theorem is referenced by: bnj1312 35193 |
| Copyright terms: Public domain | W3C validator |