| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > usgredgprvALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of usgredgprv 29097, using usgredg2 29095 instead of umgredgprv 29010. (Contributed by Alexander van der Vekens, 19-Aug-2017.) (Revised by AV, 16-Oct-2020.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| usgredg2.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| usgredgprv.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| Ref | Expression |
|---|---|
| usgredgprvALT | ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → ((𝐸‘𝑋) = {𝑀, 𝑁} → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | usgredg2.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 2 | usgredgprv.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 3 | 1, 2 | usgrss 29077 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (𝐸‘𝑋) ⊆ 𝑉) |
| 4 | 1 | usgredg2 29095 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → (♯‘(𝐸‘𝑋)) = 2) |
| 5 | sseq1 3969 | . . . . 5 ⊢ ((𝐸‘𝑋) = {𝑀, 𝑁} → ((𝐸‘𝑋) ⊆ 𝑉 ↔ {𝑀, 𝑁} ⊆ 𝑉)) | |
| 6 | fveq2 6840 | . . . . . 6 ⊢ ((𝐸‘𝑋) = {𝑀, 𝑁} → (♯‘(𝐸‘𝑋)) = (♯‘{𝑀, 𝑁})) | |
| 7 | 6 | eqeq1d 2731 | . . . . 5 ⊢ ((𝐸‘𝑋) = {𝑀, 𝑁} → ((♯‘(𝐸‘𝑋)) = 2 ↔ (♯‘{𝑀, 𝑁}) = 2)) |
| 8 | 5, 7 | anbi12d 632 | . . . 4 ⊢ ((𝐸‘𝑋) = {𝑀, 𝑁} → (((𝐸‘𝑋) ⊆ 𝑉 ∧ (♯‘(𝐸‘𝑋)) = 2) ↔ ({𝑀, 𝑁} ⊆ 𝑉 ∧ (♯‘{𝑀, 𝑁}) = 2))) |
| 9 | eqid 2729 | . . . . . . 7 ⊢ {𝑀, 𝑁} = {𝑀, 𝑁} | |
| 10 | 9 | hashprdifel 14339 | . . . . . 6 ⊢ ((♯‘{𝑀, 𝑁}) = 2 → (𝑀 ∈ {𝑀, 𝑁} ∧ 𝑁 ∈ {𝑀, 𝑁} ∧ 𝑀 ≠ 𝑁)) |
| 11 | prssg 4779 | . . . . . . . 8 ⊢ ((𝑀 ∈ {𝑀, 𝑁} ∧ 𝑁 ∈ {𝑀, 𝑁}) → ((𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ↔ {𝑀, 𝑁} ⊆ 𝑉)) | |
| 12 | 11 | 3adant3 1132 | . . . . . . 7 ⊢ ((𝑀 ∈ {𝑀, 𝑁} ∧ 𝑁 ∈ {𝑀, 𝑁} ∧ 𝑀 ≠ 𝑁) → ((𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉) ↔ {𝑀, 𝑁} ⊆ 𝑉)) |
| 13 | 12 | biimprd 248 | . . . . . 6 ⊢ ((𝑀 ∈ {𝑀, 𝑁} ∧ 𝑁 ∈ {𝑀, 𝑁} ∧ 𝑀 ≠ 𝑁) → ({𝑀, 𝑁} ⊆ 𝑉 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
| 14 | 10, 13 | syl 17 | . . . . 5 ⊢ ((♯‘{𝑀, 𝑁}) = 2 → ({𝑀, 𝑁} ⊆ 𝑉 → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
| 15 | 14 | impcom 407 | . . . 4 ⊢ (({𝑀, 𝑁} ⊆ 𝑉 ∧ (♯‘{𝑀, 𝑁}) = 2) → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉)) |
| 16 | 8, 15 | biimtrdi 253 | . . 3 ⊢ ((𝐸‘𝑋) = {𝑀, 𝑁} → (((𝐸‘𝑋) ⊆ 𝑉 ∧ (♯‘(𝐸‘𝑋)) = 2) → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
| 17 | 16 | com12 32 | . 2 ⊢ (((𝐸‘𝑋) ⊆ 𝑉 ∧ (♯‘(𝐸‘𝑋)) = 2) → ((𝐸‘𝑋) = {𝑀, 𝑁} → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
| 18 | 3, 4, 17 | syl2anc 584 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑋 ∈ dom 𝐸) → ((𝐸‘𝑋) = {𝑀, 𝑁} → (𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑉))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ⊆ wss 3911 {cpr 4587 dom cdm 5631 ‘cfv 6499 2c2 12217 ♯chash 14271 Vtxcvtx 28899 iEdgciedg 28900 USGraphcusgr 29052 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-int 4907 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-oadd 8415 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-dju 9830 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-nn 12163 df-2 12225 df-n0 12419 df-z 12506 df-uz 12770 df-fz 13445 df-hash 14272 df-umgr 28986 df-usgr 29054 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |