| 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 35118. 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 3437 | . . . . 5 ⊢ 𝑝 ∈ V | |
| 2 | 1 | bnj216 34930 | . . . 4 ⊢ (𝑚 = suc 𝑝 → 𝑝 ∈ 𝑚) |
| 3 | 2 | 3anim3i 1161 | . . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) → (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
| 4 | 3 | adantr 482 | . 2 ⊢ (((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω) → (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
| 5 | bnj556.19 | . . 3 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) | |
| 6 | bnj258 34906 | . . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω)) | |
| 7 | 5, 6 | bitri 277 | . 2 ⊢ (𝜂 ↔ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω)) |
| 8 | bnj556.18 | . 2 ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) | |
| 9 | 4, 7, 8 | 3imtr4i 294 | 1 ⊢ (𝜂 → 𝜎) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 suc csuc 6316 ωcom 7810 ∧ w-bnj17 34884 |
| 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 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-v 3435 df-un 3890 df-sn 4559 df-suc 6320 df-bnj17 34885 |
| This theorem is referenced by: bnj557 35098 bnj561 35100 bnj562 35101 |
| Copyright terms: Public domain | W3C validator |