| 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 30242. (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 3944 | . . 3 ⊢ {𝑋, 𝑌} ⊆ {𝑋, 𝑌} | |
| 3 | sseq2 3948 | . . . 4 ⊢ (((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌} → ({𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽) ↔ {𝑋, 𝑌} ⊆ {𝑋, 𝑌})) | |
| 4 | 3 | adantl 482 | . . 3 ⊢ (((𝜑 ∧ 𝑋 ≠ 𝑌) ∧ ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) → ({𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽) ↔ {𝑋, 𝑌} ⊆ {𝑋, 𝑌})) |
| 5 | 2, 4 | mpbiri 259 | . 2 ⊢ (((𝜑 ∧ 𝑋 ≠ 𝑌) ∧ ((iEdg‘𝐺)‘𝐽) = {𝑋, 𝑌}) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽)) |
| 6 | 1, 5 | mpidan 695 | 1 ⊢ ((𝜑 ∧ 𝑋 ≠ 𝑌) → {𝑋, 𝑌} ⊆ ((iEdg‘𝐺)‘𝐽)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 ⊆ wss 3890 {cpr 4564 ‘cfv 6492 〈“cs1 14556 〈“cs2 14801 Vtxcvtx 29090 iEdgciedg 29091 |
| 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 1917 ax-6 1974 ax-7 2015 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 df-cleq 2732 df-ss 3907 |
| This theorem is referenced by: upgr1wlkd 30242 upgr1trld 30243 upgr1pthd 30244 upgr1pthond 30245 |
| Copyright terms: Public domain | W3C validator |