Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1001 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj69 32657. 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 |
---|---|
bnj1001.3 | ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
bnj1001.5 | ⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) |
bnj1001.6 | ⊢ (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
bnj1001.13 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj1001.27 | ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝜒″) |
Ref | Expression |
---|---|
bnj1001 | ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1001.27 | . 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝜒″) | |
2 | bnj1001.6 | . . . . 5 ⊢ (𝜂 ↔ (𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) | |
3 | 2 | simplbi 501 | . . . 4 ⊢ (𝜂 → 𝑖 ∈ 𝑛) |
4 | 3 | bnj708 32402 | . . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑖 ∈ 𝑛) |
5 | bnj1001.3 | . . . . . 6 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
6 | 5 | bnj1232 32450 | . . . . 5 ⊢ (𝜒 → 𝑛 ∈ 𝐷) |
7 | 6 | bnj706 32400 | . . . 4 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑛 ∈ 𝐷) |
8 | bnj1001.13 | . . . . 5 ⊢ 𝐷 = (ω ∖ {∅}) | |
9 | 8 | bnj923 32414 | . . . 4 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω) |
10 | 7, 9 | syl 17 | . . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑛 ∈ ω) |
11 | elnn 7633 | . . 3 ⊢ ((𝑖 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑖 ∈ ω) | |
12 | 4, 10, 11 | syl2anc 587 | . 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑖 ∈ ω) |
13 | bnj1001.5 | . . . . . 6 ⊢ (𝜏 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚 ∧ 𝑝 = suc 𝑛)) | |
14 | 13 | simp3bi 1149 | . . . . 5 ⊢ (𝜏 → 𝑝 = suc 𝑛) |
15 | 14 | bnj707 32401 | . . . 4 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → 𝑝 = suc 𝑛) |
16 | nnord 7630 | . . . . . . 7 ⊢ (𝑛 ∈ ω → Ord 𝑛) | |
17 | ordsucelsuc 7579 | . . . . . . 7 ⊢ (Ord 𝑛 → (𝑖 ∈ 𝑛 ↔ suc 𝑖 ∈ suc 𝑛)) | |
18 | 9, 16, 17 | 3syl 18 | . . . . . 6 ⊢ (𝑛 ∈ 𝐷 → (𝑖 ∈ 𝑛 ↔ suc 𝑖 ∈ suc 𝑛)) |
19 | 18 | biimpa 480 | . . . . 5 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) → suc 𝑖 ∈ suc 𝑛) |
20 | eleq2 2819 | . . . . 5 ⊢ (𝑝 = suc 𝑛 → (suc 𝑖 ∈ 𝑝 ↔ suc 𝑖 ∈ suc 𝑛)) | |
21 | 19, 20 | anim12i 616 | . . . 4 ⊢ (((𝑛 ∈ 𝐷 ∧ 𝑖 ∈ 𝑛) ∧ 𝑝 = suc 𝑛) → (suc 𝑖 ∈ suc 𝑛 ∧ (suc 𝑖 ∈ 𝑝 ↔ suc 𝑖 ∈ suc 𝑛))) |
22 | 7, 4, 15, 21 | syl21anc 838 | . . 3 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (suc 𝑖 ∈ suc 𝑛 ∧ (suc 𝑖 ∈ 𝑝 ↔ suc 𝑖 ∈ suc 𝑛))) |
23 | bianir 1059 | . . 3 ⊢ ((suc 𝑖 ∈ suc 𝑛 ∧ (suc 𝑖 ∈ 𝑝 ↔ suc 𝑖 ∈ suc 𝑛)) → suc 𝑖 ∈ 𝑝) | |
24 | 22, 23 | syl 17 | . 2 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → suc 𝑖 ∈ 𝑝) |
25 | 1, 12, 24 | 3jca 1130 | 1 ⊢ ((𝜃 ∧ 𝜒 ∧ 𝜏 ∧ 𝜂) → (𝜒″ ∧ 𝑖 ∈ ω ∧ suc 𝑖 ∈ 𝑝)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2112 ∖ cdif 3850 ∅c0 4223 {csn 4527 Ord word 6190 suc csuc 6193 Fn wfn 6353 ‘cfv 6358 ωcom 7622 ∧ w-bnj17 32331 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-11 2160 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 ax-un 7501 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-ne 2933 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-tr 5147 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-we 5496 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-om 7623 df-bnj17 32332 |
This theorem is referenced by: bnj1020 32612 |
Copyright terms: Public domain | W3C validator |