![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1015 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj69 32392. 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 |
---|---|
bnj1015.1 | ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
bnj1015.2 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj1015.13 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj1015.14 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
bnj1015.15 | ⊢ 𝐺 ∈ 𝑉 |
bnj1015.16 | ⊢ 𝐽 ∈ 𝑉 |
Ref | Expression |
---|---|
bnj1015 | ⊢ ((𝐺 ∈ 𝐵 ∧ 𝐽 ∈ dom 𝐺) → (𝐺‘𝐽) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1015.16 | . . 3 ⊢ 𝐽 ∈ 𝑉 | |
2 | 1 | elexi 3460 | . 2 ⊢ 𝐽 ∈ V |
3 | eleq1 2877 | . . . 4 ⊢ (𝑗 = 𝐽 → (𝑗 ∈ dom 𝐺 ↔ 𝐽 ∈ dom 𝐺)) | |
4 | 3 | anbi2d 631 | . . 3 ⊢ (𝑗 = 𝐽 → ((𝐺 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝐺) ↔ (𝐺 ∈ 𝐵 ∧ 𝐽 ∈ dom 𝐺))) |
5 | fveq2 6645 | . . . 4 ⊢ (𝑗 = 𝐽 → (𝐺‘𝑗) = (𝐺‘𝐽)) | |
6 | 5 | sseq1d 3946 | . . 3 ⊢ (𝑗 = 𝐽 → ((𝐺‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅) ↔ (𝐺‘𝐽) ⊆ trCl(𝑋, 𝐴, 𝑅))) |
7 | 4, 6 | imbi12d 348 | . 2 ⊢ (𝑗 = 𝐽 → (((𝐺 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝐺) → (𝐺‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝐺 ∈ 𝐵 ∧ 𝐽 ∈ dom 𝐺) → (𝐺‘𝐽) ⊆ trCl(𝑋, 𝐴, 𝑅)))) |
8 | bnj1015.15 | . . . 4 ⊢ 𝐺 ∈ 𝑉 | |
9 | 8 | elexi 3460 | . . 3 ⊢ 𝐺 ∈ V |
10 | eleq1 2877 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔 ∈ 𝐵 ↔ 𝐺 ∈ 𝐵)) | |
11 | dmeq 5736 | . . . . . 6 ⊢ (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺) | |
12 | 11 | eleq2d 2875 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑗 ∈ dom 𝑔 ↔ 𝑗 ∈ dom 𝐺)) |
13 | 10, 12 | anbi12d 633 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) ↔ (𝐺 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝐺))) |
14 | fveq1 6644 | . . . . 5 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑗) = (𝐺‘𝑗)) | |
15 | 14 | sseq1d 3946 | . . . 4 ⊢ (𝑔 = 𝐺 → ((𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅) ↔ (𝐺‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))) |
16 | 13, 15 | imbi12d 348 | . . 3 ⊢ (𝑔 = 𝐺 → (((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝐺 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝐺) → (𝐺‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)))) |
17 | bnj1015.1 | . . . 4 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
18 | bnj1015.2 | . . . 4 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
19 | bnj1015.13 | . . . 4 ⊢ 𝐷 = (ω ∖ {∅}) | |
20 | bnj1015.14 | . . . 4 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
21 | 17, 18, 19, 20 | bnj1014 32343 | . . 3 ⊢ ((𝑔 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝑔) → (𝑔‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
22 | 9, 16, 21 | vtocl 3507 | . 2 ⊢ ((𝐺 ∈ 𝐵 ∧ 𝑗 ∈ dom 𝐺) → (𝐺‘𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
23 | 2, 7, 22 | vtocl 3507 | 1 ⊢ ((𝐺 ∈ 𝐵 ∧ 𝐽 ∈ dom 𝐺) → (𝐺‘𝐽) ⊆ trCl(𝑋, 𝐴, 𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 {cab 2776 ∀wral 3106 ∃wrex 3107 ∖ cdif 3878 ⊆ wss 3881 ∅c0 4243 {csn 4525 ∪ ciun 4881 dom cdm 5519 suc csuc 6161 Fn wfn 6319 ‘cfv 6324 ωcom 7560 predc-bnj14 32068 trClc-bnj18 32074 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-dm 5529 df-iota 6283 df-fv 6332 df-bnj18 32075 |
This theorem is referenced by: bnj1018g 32345 bnj1018 32346 |
Copyright terms: Public domain | W3C validator |