![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj558 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj852 34914. 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 |
---|---|
bnj558.3 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj558.16 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) |
bnj558.17 | ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) |
bnj558.18 | ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
bnj558.19 | ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) |
bnj558.20 | ⊢ (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖)) |
bnj558.21 | ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) |
bnj558.22 | ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) |
bnj558.23 | ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) |
bnj558.24 | ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) |
bnj558.25 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, 𝐶〉}) |
bnj558.28 | ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) |
bnj558.29 | ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj558.36 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛) |
Ref | Expression |
---|---|
bnj558 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → (𝐺‘suc 𝑖) = 𝐾) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj558.3 | . . 3 ⊢ 𝐷 = (ω ∖ {∅}) | |
2 | bnj558.16 | . . 3 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) | |
3 | bnj558.17 | . . 3 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) | |
4 | bnj558.18 | . . 3 ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) | |
5 | bnj558.19 | . . 3 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) | |
6 | bnj558.20 | . . 3 ⊢ (𝜁 ↔ (𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑛 ∧ 𝑚 = suc 𝑖)) | |
7 | bnj558.21 | . . 3 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
8 | bnj558.22 | . . 3 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
9 | bnj558.23 | . . 3 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
10 | bnj558.24 | . . 3 ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
11 | bnj558.25 | . . 3 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, 𝐶〉}) | |
12 | bnj558.28 | . . 3 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) | |
13 | bnj558.29 | . . 3 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
14 | bnj558.36 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛) | |
15 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 | bnj557 34894 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → (𝐺‘𝑚) = 𝐿) |
16 | bnj422 34708 | . . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) ↔ (𝜂 ∧ 𝜁 ∧ 𝑅 FrSe 𝐴 ∧ 𝜏)) | |
17 | bnj253 34697 | . . . . 5 ⊢ ((𝜂 ∧ 𝜁 ∧ 𝑅 FrSe 𝐴 ∧ 𝜏) ↔ ((𝜂 ∧ 𝜁) ∧ 𝑅 FrSe 𝐴 ∧ 𝜏)) | |
18 | 16, 17 | bitri 275 | . . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) ↔ ((𝜂 ∧ 𝜁) ∧ 𝑅 FrSe 𝐴 ∧ 𝜏)) |
19 | 18 | simp1bi 1144 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → (𝜂 ∧ 𝜁)) |
20 | 5, 6, 9, 10, 9, 10 | bnj554 34892 | . . 3 ⊢ ((𝜂 ∧ 𝜁) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾)) |
21 | 19, 20 | syl 17 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → ((𝐺‘𝑚) = 𝐿 ↔ (𝐺‘suc 𝑖) = 𝐾)) |
22 | 15, 21 | mpbid 232 | 1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜂 ∧ 𝜁) → (𝐺‘suc 𝑖) = 𝐾) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ∀wral 3059 ∖ cdif 3960 ∪ cun 3961 ∅c0 4339 {csn 4631 〈cop 4637 ∪ ciun 4996 suc csuc 6388 Fn wfn 6558 ‘cfv 6563 ωcom 7887 ∧ w-bnj17 34679 predc-bnj14 34681 FrSe w-bnj15 34685 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 ax-reg 9630 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-id 5583 df-eprel 5589 df-fr 5641 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-res 5701 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-fv 6571 df-bnj17 34680 |
This theorem is referenced by: bnj571 34899 |
Copyright terms: Public domain | W3C validator |