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 32887. 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 | fnfund 6527 | . . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → Fun 𝐺) |
3 | opex 5378 | . . . . . . 7 ⊢ 〈𝑚, 𝐶〉 ∈ V | |
4 | 3 | snid 4598 | . . . . . 6 ⊢ 〈𝑚, 𝐶〉 ∈ {〈𝑚, 𝐶〉} |
5 | elun2 4111 | . . . . . 6 ⊢ (〈𝑚, 𝐶〉 ∈ {〈𝑚, 𝐶〉} → 〈𝑚, 𝐶〉 ∈ (𝑓 ∪ {〈𝑚, 𝐶〉})) | |
6 | 4, 5 | ax-mp 5 | . . . . 5 ⊢ 〈𝑚, 𝐶〉 ∈ (𝑓 ∪ {〈𝑚, 𝐶〉}) |
7 | bnj553.8 | . . . . 5 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, 𝐶〉}) | |
8 | 6, 7 | eleqtrri 2838 | . . . 4 ⊢ 〈𝑚, 𝐶〉 ∈ 𝐺 |
9 | funopfv 6814 | . . . 4 ⊢ (Fun 𝐺 → (〈𝑚, 𝐶〉 ∈ 𝐺 → (𝐺‘𝑚) = 𝐶)) | |
10 | 2, 8, 9 | mpisyl 21 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝐺‘𝑚) = 𝐶) |
11 | 10 | 3ad2ant1 1132 | . 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐶) |
12 | fveq2 6767 | . . . . . 6 ⊢ (𝑝 = 𝑖 → (𝐺‘𝑝) = (𝐺‘𝑖)) | |
13 | 12 | bnj1113 32751 | . . . . 5 ⊢ (𝑝 = 𝑖 → ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅)) |
14 | bnj553.11 | . . . . 5 ⊢ 𝐿 = ∪ 𝑦 ∈ (𝐺‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
15 | bnj553.10 | . . . . 5 ⊢ 𝐾 = ∪ 𝑦 ∈ (𝐺‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
16 | 13, 14, 15 | 3eqtr4g 2803 | . . . 4 ⊢ (𝑝 = 𝑖 → 𝐿 = 𝐾) |
17 | 16 | 3ad2ant3 1134 | . . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐿 = 𝐾) |
18 | bnj553.5 | . . . . 5 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) | |
19 | bnj553.9 | . . . . 5 ⊢ 𝐵 = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) | |
20 | bnj553.4 | . . . . 5 ⊢ 𝐺 = (𝑓 ∪ {〈𝑚, ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)〉}) | |
21 | 18, 19, 15, 20, 1 | bnj548 32863 | . . . 4 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚) → 𝐵 = 𝐾) |
22 | 21 | 3adant3 1131 | . . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐵 = 𝐾) |
23 | fveq2 6767 | . . . . . 6 ⊢ (𝑝 = 𝑖 → (𝑓‘𝑝) = (𝑓‘𝑖)) | |
24 | 23 | bnj1113 32751 | . . . . 5 ⊢ (𝑝 = 𝑖 → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) |
25 | bnj553.7 | . . . . . . 7 ⊢ 𝐶 = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) | |
26 | 19, 25 | eqeq12i 2756 | . . . . . 6 ⊢ (𝐵 = 𝐶 ↔ ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅)) |
27 | eqcom 2745 | . . . . . 6 ⊢ (∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ↔ ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) | |
28 | 26, 27 | bitri 274 | . . . . 5 ⊢ (𝐵 = 𝐶 ↔ ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)) |
29 | 24, 28 | sylibr 233 | . . . 4 ⊢ (𝑝 = 𝑖 → 𝐵 = 𝐶) |
30 | 29 | 3ad2ant3 1134 | . . 3 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐵 = 𝐶) |
31 | 17, 22, 30 | 3eqtr2rd 2785 | . 2 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → 𝐶 = 𝐿) |
32 | 11, 31 | eqtrd 2778 | 1 ⊢ (((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑖 ∈ 𝑚 ∧ 𝑝 = 𝑖) → (𝐺‘𝑚) = 𝐿) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ∖ cdif 3884 ∪ cun 3885 ∅c0 4257 {csn 4562 〈cop 4568 ∪ ciun 4925 suc csuc 6262 Fun wfun 6421 Fn wfn 6422 ‘cfv 6427 ωcom 7703 predc-bnj14 32653 FrSe w-bnj15 32657 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5222 ax-nul 5229 ax-pr 5351 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3432 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4258 df-if 4461 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4841 df-iun 4927 df-br 5075 df-opab 5137 df-id 5485 df-xp 5591 df-rel 5592 df-cnv 5593 df-co 5594 df-dm 5595 df-res 5597 df-iota 6385 df-fun 6429 df-fn 6430 df-fv 6435 |
This theorem is referenced by: bnj557 32867 |
Copyright terms: Public domain | W3C validator |