| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1491 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj60 35359. 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 |
|---|---|
| bnj1491.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
| bnj1491.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| bnj1491.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
| bnj1491.4 | ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| bnj1491.5 | ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} |
| bnj1491.6 | ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) |
| bnj1491.7 | ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) |
| bnj1491.8 | ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) |
| bnj1491.9 | ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} |
| bnj1491.10 | ⊢ 𝑃 = ∪ 𝐻 |
| bnj1491.11 | ⊢ 𝑍 = 〈𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
| bnj1491.12 | ⊢ 𝑄 = (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) |
| bnj1491.13 | ⊢ (𝜒 → (𝑄 ∈ 𝐶 ∧ dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| Ref | Expression |
|---|---|
| bnj1491 | ⊢ ((𝜒 ∧ 𝑄 ∈ V) → ∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj1491.13 | . 2 ⊢ (𝜒 → (𝑄 ∈ 𝐶 ∧ dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) | |
| 2 | bnj1491.1 | . . . . 5 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} | |
| 3 | bnj1491.2 | . . . . 5 ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
| 4 | bnj1491.3 | . . . . 5 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
| 5 | bnj1491.4 | . . . . 5 ⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) | |
| 6 | bnj1491.5 | . . . . 5 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} | |
| 7 | bnj1491.6 | . . . . 5 ⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅)) | |
| 8 | bnj1491.7 | . . . . 5 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)) | |
| 9 | bnj1491.8 | . . . . 5 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏) | |
| 10 | bnj1491.9 | . . . . 5 ⊢ 𝐻 = {𝑓 ∣ ∃𝑦 ∈ pred (𝑥, 𝐴, 𝑅)𝜏′} | |
| 11 | bnj1491.10 | . . . . 5 ⊢ 𝑃 = ∪ 𝐻 | |
| 12 | bnj1491.11 | . . . . 5 ⊢ 𝑍 = 〈𝑥, (𝑃 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
| 13 | bnj1491.12 | . . . . 5 ⊢ 𝑄 = (𝑃 ∪ {〈𝑥, (𝐺‘𝑍)〉}) | |
| 14 | 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 | bnj1466 35350 | . . . 4 ⊢ (𝑤 ∈ 𝑄 → ∀𝑓 𝑤 ∈ 𝑄) |
| 15 | 14 | nfcii 2915 | . . 3 ⊢ Ⅎ𝑓𝑄 |
| 16 | 4 | bnj1317 35118 | . . . . . 6 ⊢ (𝑤 ∈ 𝐶 → ∀𝑓 𝑤 ∈ 𝐶) |
| 17 | 16 | nfcii 2915 | . . . . 5 ⊢ Ⅎ𝑓𝐶 |
| 18 | 15, 17 | nfel 2940 | . . . 4 ⊢ Ⅎ𝑓 𝑄 ∈ 𝐶 |
| 19 | 15 | nfdm 5929 | . . . . 5 ⊢ Ⅎ𝑓dom 𝑄 |
| 20 | 19 | nfeq1 2941 | . . . 4 ⊢ Ⅎ𝑓dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) |
| 21 | 18, 20 | nfan 1921 | . . 3 ⊢ Ⅎ𝑓(𝑄 ∈ 𝐶 ∧ dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) |
| 22 | eleq1 2852 | . . . 4 ⊢ (𝑓 = 𝑄 → (𝑓 ∈ 𝐶 ↔ 𝑄 ∈ 𝐶)) | |
| 23 | dmeq 5881 | . . . . 5 ⊢ (𝑓 = 𝑄 → dom 𝑓 = dom 𝑄) | |
| 24 | 23 | eqeq1d 2766 | . . . 4 ⊢ (𝑓 = 𝑄 → (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) ↔ dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| 25 | 22, 24 | anbi12d 641 | . . 3 ⊢ (𝑓 = 𝑄 → ((𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) ↔ (𝑄 ∈ 𝐶 ∧ dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))) |
| 26 | 15, 21, 25 | spcegf 3553 | . 2 ⊢ (𝑄 ∈ V → ((𝑄 ∈ 𝐶 ∧ dom 𝑄 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))) → ∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))) |
| 27 | 1, 26 | mpan9 514 | 1 ⊢ ((𝜒 ∧ 𝑄 ∈ V) → ∃𝑓(𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∃wex 1801 ∈ wcel 2144 {cab 2742 ≠ wne 2959 ∀wral 3078 ∃wrex 3088 {crab 3416 Vcvv 3456 [wsbc 3746 ∪ cun 3904 ⊆ wss 3906 ∅c0 4287 {csn 4584 〈cop 4590 ∪ cuni 4867 class class class wbr 5102 dom cdm 5649 ↾ cres 5651 Fn wfn 6518 ‘cfv 6523 predc-bnj14 34986 FrSe w-bnj15 34990 trClc-bnj18 34992 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-xp 5655 df-dm 5659 df-res 5661 df-iota 6479 df-fv 6531 |
| This theorem is referenced by: bnj1312 35355 |
| Copyright terms: Public domain | W3C validator |