| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifpsnprss | Structured version Visualization version GIF version | ||
| Description: Lemma for wlkvtxeledg 29642: Two adjacent (not necessarily different) vertices 𝐴 and 𝐵 in a walk are incident with an edge 𝐸. (Contributed by AV, 4-Apr-2021.) (Revised by AV, 5-Nov-2021.) |
| Ref | Expression |
|---|---|
| ifpsnprss | ⊢ (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssidd 4007 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴} ⊆ {𝐴}) | |
| 2 | preq2 4734 | . . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴}) | |
| 3 | dfsn2 4639 | . . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 4 | 2, 3 | eqtr4di 2795 | . . . . 5 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴}) |
| 5 | 4 | eqcoms 2745 | . . . 4 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴}) |
| 6 | 5 | adantr 480 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} = {𝐴}) |
| 7 | simpr 484 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → 𝐸 = {𝐴}) | |
| 8 | 1, 6, 7 | 3sstr4d 4039 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} ⊆ 𝐸) |
| 9 | 8 | 1fpid3 1082 | 1 ⊢ (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 if-wif 1063 = wceq 1540 ⊆ wss 3951 {csn 4626 {cpr 4628 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ifp 1064 df-tru 1543 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-v 3482 df-un 3956 df-ss 3968 df-sn 4627 df-pr 4629 |
| This theorem is referenced by: wlkvtxeledg 29642 |
| Copyright terms: Public domain | W3C validator |