| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > disjxwwlkn | Structured version Visualization version GIF version | ||
| Description: Sets of walks (as words) extended by an edge are disjunct if each set contains extensions of distinct walks. (Contributed by Alexander van der Vekens, 21-Aug-2018.) (Revised by AV, 20-Apr-2021.) (Revised by AV, 26-Oct-2022.) |
| Ref | Expression |
|---|---|
| wwlksnextprop.x | ⊢ 𝑋 = ((𝑁 + 1) WWalksN 𝐺) |
| wwlksnextprop.e | ⊢ 𝐸 = (Edg‘𝐺) |
| wwlksnextprop.y | ⊢ 𝑌 = {𝑤 ∈ (𝑁 WWalksN 𝐺) ∣ (𝑤‘0) = 𝑃} |
| Ref | Expression |
|---|---|
| disjxwwlkn | ⊢ Disj 𝑦 ∈ 𝑌 {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1154 | . . . . . 6 ⊢ (((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸) → (𝑥 prefix 𝑀) = 𝑦) | |
| 2 | 1 | a1i 11 | . . . . 5 ⊢ (𝑥 ∈ 𝑋 → (((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸) → (𝑥 prefix 𝑀) = 𝑦)) |
| 3 | 2 | ss2rabi 4004 | . . . 4 ⊢ {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)} ⊆ {𝑥 ∈ 𝑋 ∣ (𝑥 prefix 𝑀) = 𝑦} |
| 4 | wwlksnextprop.x | . . . . . 6 ⊢ 𝑋 = ((𝑁 + 1) WWalksN 𝐺) | |
| 5 | wwlkssswwlksn 30512 | . . . . . . 7 ⊢ ((𝑁 + 1) WWalksN 𝐺) ⊆ (WWalks‘𝐺) | |
| 6 | eqid 2763 | . . . . . . . 8 ⊢ (Vtx‘𝐺) = (Vtx‘𝐺) | |
| 7 | 6 | wwlkssswrd 30508 | . . . . . . 7 ⊢ (WWalks‘𝐺) ⊆ Word (Vtx‘𝐺) |
| 8 | 5, 7 | sstri 3922 | . . . . . 6 ⊢ ((𝑁 + 1) WWalksN 𝐺) ⊆ Word (Vtx‘𝐺) |
| 9 | 4, 8 | eqsstri 3959 | . . . . 5 ⊢ 𝑋 ⊆ Word (Vtx‘𝐺) |
| 10 | rabss2 4005 | . . . . 5 ⊢ (𝑋 ⊆ Word (Vtx‘𝐺) → {𝑥 ∈ 𝑋 ∣ (𝑥 prefix 𝑀) = 𝑦} ⊆ {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦}) | |
| 11 | 9, 10 | ax-mp 5 | . . . 4 ⊢ {𝑥 ∈ 𝑋 ∣ (𝑥 prefix 𝑀) = 𝑦} ⊆ {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦} |
| 12 | 3, 11 | sstri 3922 | . . 3 ⊢ {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)} ⊆ {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦} |
| 13 | 12 | rgenw 3084 | . 2 ⊢ ∀𝑦 ∈ 𝑌 {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)} ⊆ {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦} |
| 14 | disjwrdpfx 14891 | . 2 ⊢ Disj 𝑦 ∈ 𝑌 {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦} | |
| 15 | disjss2 5078 | . 2 ⊢ (∀𝑦 ∈ 𝑌 {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)} ⊆ {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦} → (Disj 𝑦 ∈ 𝑌 {𝑥 ∈ Word (Vtx‘𝐺) ∣ (𝑥 prefix 𝑀) = 𝑦} → Disj 𝑦 ∈ 𝑌 {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)})) | |
| 16 | 13, 14, 15 | mp2 9 | 1 ⊢ Disj 𝑦 ∈ 𝑌 {𝑥 ∈ 𝑋 ∣ ((𝑥 prefix 𝑀) = 𝑦 ∧ (𝑦‘0) = 𝑃 ∧ {(lastS‘𝑦), (lastS‘𝑥)} ∈ 𝐸)} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {crab 3416 ⊆ wss 3900 {cpr 4590 Disj wdisj 5075 ‘cfv 6566 (class class class)co 7451 0cc0 11239 1c1 11240 + caddc 11242 Word cword 14699 lastSclsw 14748 prefix cpfx 14862 Vtxcvtx 29631 Edgcedg 29682 WWalkscwwlks 30471 WWalksN cwwlksn 30472 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-disj 5076 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-wwlks 30476 df-wwlksn 30477 |
| This theorem is used by: hashwwlksnext 30560 |
| Copyright terms: Public domain | W3C validator |