Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > upgr1wlkdlem2 | Structured version Visualization version GIF version |
Description: Lemma 2 for upgr1wlkd 28511. (Contributed by AV, 22-Jan-2021.) |
Ref | Expression |
---|---|
upgr1wlkd.p | ⊢ 𝑃 = 〈“𝑋𝑌”〉 |
upgr1wlkd.f | ⊢ 𝐹 = 〈“𝐽”〉 |
upgr1wlkd.x | ⊢ (𝜑 → 𝑋 ∈ (Vtx‘𝐺)) |
upgr1wlkd.y | ⊢ (𝜑 → 𝑌 ∈ (Vtx‘𝐺)) |
upgr1wlkd.j | ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) |
Ref | Expression |
---|---|
upgr1wlkdlem2 | ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upgr1wlkd.j | . 2 ⊢ (𝜑 → ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) | |
2 | ssid 3943 | . . 3 ⊢ {𝑋, 𝑌} ⊆ {𝑋, 𝑌} | |
3 | sseq2 3947 | . . . 4 ⊢ (((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌} → ({𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽) ↔ {𝑋, 𝑌} ⊆ {𝑋, 𝑌})) | |
4 | 3 | adantl 482 | . . 3 ⊢ (((𝜑 ∧ 𝑋 ≠ 𝑌) ∧ ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) → ({𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽) ↔ {𝑋, 𝑌} ⊆ {𝑋, 𝑌})) |
5 | 2, 4 | mpbiri 257 | . 2 ⊢ (((𝜑 ∧ 𝑋 ≠ 𝑌) ∧ ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽)) |
6 | 1, 5 | mpidan 686 | 1 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ⊆ wss 3887 {cpr 4563 ‘cfv 6433 〈“cs1 14300 〈“cs2 14554 Vtxcvtx 27366 iEdgciedg 27367 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1542 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-v 3434 df-in 3894 df-ss 3904 |
This theorem is referenced by: upgr1wlkd 28511 upgr1trld 28512 upgr1pthd 28513 upgr1pthond 28514 |
Copyright terms: Public domain | W3C validator |