| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj556 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj852 35279. 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 |
|---|---|
| bnj556.18 | ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
| bnj556.19 | ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) |
| Ref | Expression |
|---|---|
| bnj556 | ⊢ (𝜂 → 𝜎) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3466 | . . . . 5 ⊢ 𝑝 ∈ V | |
| 2 | 1 | bnj216 35091 | . . . 4 ⊢ (𝑚 = suc 𝑝 → 𝑝 ∈ 𝑚) |
| 3 | 2 | 3anim3i 1170 | . . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) → (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
| 4 | 3 | adantr 485 | . 2 ⊢ (((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω) → (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
| 5 | bnj556.19 | . . 3 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) | |
| 6 | bnj258 35067 | . . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω)) | |
| 7 | 5, 6 | bitri 278 | . 2 ⊢ (𝜂 ↔ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω)) |
| 8 | bnj556.18 | . 2 ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) | |
| 9 | 4, 7, 8 | 3imtr4i 295 | 1 ⊢ (𝜂 → 𝜎) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1568 ∈ wcel 2150 suc csuc 6366 ωcom 7865 ∧ w-bnj17 35045 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-v 3464 df-un 3918 df-sn 4595 df-suc 6370 df-bnj17 35046 |
| This theorem is referenced by: bnj557 35259 bnj561 35261 bnj562 35262 |
| Copyright terms: Public domain | W3C validator |