Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj554 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj852 32193. 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 |
---|---|
bnj554.19 | ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) |
bnj554.20 | ⊢ (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖)) |
bnj554.21 | ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) |
bnj554.22 | ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) |
bnj554.23 | ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) |
bnj554.24 | ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) |
Ref | Expression |
---|---|
bnj554 | ⊢ ((𝜂 ∧ 𝜁) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj554.19 | . . 3 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) | |
2 | 1 | bnj1254 32081 | . 2 ⊢ (𝜂 → 𝑚 = suc 𝑝) |
3 | bnj554.20 | . . 3 ⊢ (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖)) | |
4 | 3 | simp3bi 1143 | . 2 ⊢ (𝜁 → 𝑚 = suc 𝑖) |
5 | simpr 487 | . . 3 ⊢ ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → 𝑚 = suc 𝑖) | |
6 | bnj551 32013 | . . 3 ⊢ ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → 𝑝 = 𝑖) | |
7 | fveq2 6670 | . . . 4 ⊢ (𝑚 = suc 𝑖 → (𝐺‘𝑚) = (𝐺‘suc 𝑖)) | |
8 | fveq2 6670 | . . . . 5 ⊢ (𝑝 = 𝑖 → (𝐺‘𝑝) = (𝐺‘𝑖)) | |
9 | iuneq1 4935 | . . . . . 6 ⊢ ((𝐺‘𝑝) = (𝐺‘𝑖) → ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)) | |
10 | bnj554.24 | . . . . . 6 ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
11 | bnj554.23 | . . . . . 6 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
12 | 9, 10, 11 | 3eqtr4g 2881 | . . . . 5 ⊢ ((𝐺‘𝑝) = (𝐺‘𝑖) → 𝐿 = 𝐾) |
13 | 8, 12 | syl 17 | . . . 4 ⊢ (𝑝 = 𝑖 → 𝐿 = 𝐾) |
14 | 7, 13 | eqeqan12d 2838 | . . 3 ⊢ ((𝑚 = suc 𝑖 ∧ 𝑝 = 𝑖) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾)) |
15 | 5, 6, 14 | syl2anc 586 | . 2 ⊢ ((𝑚 = suc 𝑝 ∧ 𝑚 = suc 𝑖) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾)) |
16 | 2, 4, 15 | syl2an 597 | 1 ⊢ ((𝜂 ∧ 𝜁) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∪ ciun 4919 suc csuc 6193 ‘cfv 6355 ωcom 7580 ∧ w-bnj17 31956 predc-bnj14 31958 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 ax-un 7461 ax-reg 9056 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-eprel 5465 df-fr 5514 df-suc 6197 df-iota 6314 df-fv 6363 df-bnj17 31957 |
This theorem is referenced by: bnj558 32174 |
Copyright terms: Public domain | W3C validator |