Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj553 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj852 30991. 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 |
---|---|
bnj553.1 | ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) |
bnj553.2 | ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj553.3 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj553.4 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) |
bnj553.5 | ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) |
bnj553.6 | ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
bnj553.7 | ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) |
bnj553.8 | ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, 𝐶〉}) |
bnj553.9 | ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) |
bnj553.10 | ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) |
bnj553.11 | ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) |
bnj553.12 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛) |
Ref | Expression |
---|---|
bnj553 | ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐿) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj553.12 | . . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → 𝐺 Fn 𝑛) | |
2 | 1 | bnj930 30840 | . . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → Fun 𝐺) |
3 | opex 4932 | . . . . . . 7 ⊢ 〈𝑚, 𝐶〉 ∈ V | |
4 | 3 | snid 4208 | . . . . . 6 ⊢ 〈𝑚, 𝐶〉 ∈ {〈𝑚, 𝐶〉} |
5 | elun2 3781 | . . . . . 6 ⊢ (〈𝑚, 𝐶〉 ∈ {〈𝑚, 𝐶〉} → 〈𝑚, 𝐶〉 ∈ (𝑓 ∪ {〈𝑚, 𝐶〉})) | |
6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ 〈𝑚, 𝐶〉 ∈ (𝑓 ∪ {〈𝑚, 𝐶〉}) |
7 | bnj553.8 | . . . . 5 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, 𝐶〉}) | |
8 | 6, 7 | eleqtrri 2700 | . . . 4 ⊢ 〈𝑚, 𝐶〉 ∈ 𝐺 |
9 | funopfv 6235 | . . . 4 ⊢ (Fun 𝐺 → (〈𝑚, 𝐶〉 ∈ 𝐺 → (𝐺‘𝑚) = 𝐶)) | |
10 | 2, 8, 9 | mpisyl 21 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝐺‘𝑚) = 𝐶) |
11 | 10 | 3ad2ant1 1082 | . 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐶) |
12 | fveq2 6191 | . . . . . 6 ⊢ (𝑝 = 𝑖 → (𝐺‘𝑝) = (𝐺‘𝑖)) | |
13 | 12 | bnj1113 30856 | . . . . 5 ⊢ (𝑝 = 𝑖 → ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)) |
14 | bnj553.11 | . . . . 5 ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
15 | bnj553.10 | . . . . 5 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
16 | 13, 14, 15 | 3eqtr4g 2681 | . . . 4 ⊢ (𝑝 = 𝑖 → 𝐿 = 𝐾) |
17 | 16 | 3ad2ant3 1084 | . . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐿 = 𝐾) |
18 | bnj553.5 | . . . . 5 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) | |
19 | bnj553.9 | . . . . 5 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
20 | bnj553.4 | . . . . 5 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) | |
21 | 18, 19, 15, 20, 1 | bnj548 30967 | . . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝐵 = 𝐾) |
22 | 21 | 3adant3 1081 | . . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐵 = 𝐾) |
23 | fveq2 6191 | . . . . . 6 ⊢ (𝑝 = 𝑖 → (𝑓‘𝑝) = (𝑓‘𝑖)) | |
24 | 23 | bnj1113 30856 | . . . . 5 ⊢ (𝑝 = 𝑖 → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) |
25 | bnj553.7 | . . . . . . 7 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
26 | 19, 25 | eqeq12i 2636 | . . . . . 6 ⊢ (𝐵 = 𝐶 ↔ ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)) |
27 | eqcom 2629 | . . . . . 6 ⊢ (∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ↔ ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) | |
28 | 26, 27 | bitri 264 | . . . . 5 ⊢ (𝐵 = 𝐶 ↔ ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) |
29 | 24, 28 | sylibr 224 | . . . 4 ⊢ (𝑝 = 𝑖 → 𝐵 = 𝐶) |
30 | 29 | 3ad2ant3 1084 | . . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐵 = 𝐶) |
31 | 17, 22, 30 | 3eqtr2rd 2663 | . 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐶 = 𝐿) |
32 | 11, 31 | eqtrd 2656 | 1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐿) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∀wral 2912 ∖ cdif 3571 ∪ cun 3572 ∅c0 3915 {csn 4177 〈cop 4183 ∪ ciun 4520 suc csuc 5725 Fun wfun 5882 Fn wfn 5883 ‘cfv 5888 ωcom 7065 predc-bnj14 30754 FrSe w-bnj15 30758 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-res 5126 df-iota 5851 df-fun 5890 df-fn 5891 df-fv 5896 |
This theorem is referenced by: bnj557 30971 |
Copyright terms: Public domain | W3C validator |