Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ifpsnprss | Structured version Visualization version GIF version |
Description: Lemma for wlkvtxeledg 27557: 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 3898 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴} ⊆ {𝐴}) | |
2 | preq2 4622 | . . . . . 6 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴, 𝐴}) | |
3 | dfsn2 4526 | . . . . . 6 ⊢ {𝐴} = {𝐴, 𝐴} | |
4 | 2, 3 | eqtr4di 2791 | . . . . 5 ⊢ (𝐵 = 𝐴 → {𝐴, 𝐵} = {𝐴}) |
5 | 4 | eqcoms 2746 | . . . 4 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐵} = {𝐴}) |
6 | 5 | adantr 484 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} = {𝐴}) |
7 | simpr 488 | . . 3 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → 𝐸 = {𝐴}) | |
8 | 1, 6, 7 | 3sstr4d 3922 | . 2 ⊢ ((𝐴 = 𝐵 ∧ 𝐸 = {𝐴}) → {𝐴, 𝐵} ⊆ 𝐸) |
9 | 8 | 1fpid3 1083 | 1 ⊢ (if-(𝐴 = 𝐵, 𝐸 = {𝐴}, {𝐴, 𝐵} ⊆ 𝐸) → {𝐴, 𝐵} ⊆ 𝐸) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 if-wif 1062 = wceq 1542 ⊆ wss 3841 {csn 4513 {cpr 4515 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1916 ax-6 1974 ax-7 2019 ax-8 2115 ax-9 2123 ax-ext 2710 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-ifp 1063 df-tru 1545 df-ex 1787 df-sb 2074 df-clab 2717 df-cleq 2730 df-clel 2811 df-v 3399 df-un 3846 df-in 3848 df-ss 3858 df-sn 4514 df-pr 4516 |
This theorem is referenced by: wlkvtxeledg 27557 |
Copyright terms: Public domain | W3C validator |