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 30245. 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 3176 | . . . . 5 ⊢ 𝑝 ∈ V | |
2 | 1 | bnj216 30054 | . . . 4 ⊢ (𝑚 = suc 𝑝 → 𝑝 ∈ 𝑚) |
3 | 2 | 3anim3i 1243 | . . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) → (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
4 | 3 | adantr 480 | . 2 ⊢ (((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω) → (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
5 | bnj556.19 | . . 3 ⊢ (𝜂 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝)) | |
6 | bnj258 30027 | . . 3 ⊢ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ ω ∧ 𝑚 = suc 𝑝) ↔ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω)) | |
7 | 5, 6 | bitri 263 | . 2 ⊢ (𝜂 ↔ ((𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑚 = suc 𝑝) ∧ 𝑝 ∈ ω)) |
8 | bnj556.18 | . 2 ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) | |
9 | 4, 7, 8 | 3imtr4i 280 | 1 ⊢ (𝜂 → 𝜎) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 suc csuc 5642 ωcom 6957 ∧ w-bnj17 30005 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-v 3175 df-un 3545 df-sn 4126 df-suc 5646 df-bnj17 30006 |
This theorem is referenced by: bnj557 30225 bnj561 30227 bnj562 30228 |
Copyright terms: Public domain | W3C validator |