| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > usgredg2vlem1 | GIF version | ||
| Description: Lemma 1 for usgredg2v 16211. (Contributed by Alexander van der Vekens, 4-Jan-2018.) (Revised by AV, 18-Oct-2020.) |
| Ref | Expression |
|---|---|
| usgredg2v.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| usgredg2v.e | ⊢ 𝐸 = (iEdg‘𝐺) |
| usgredg2v.a | ⊢ 𝐴 = {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)} |
| Ref | Expression |
|---|---|
| usgredg2vlem1 | ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 5669 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝐸‘𝑥) = (𝐸‘𝑌)) | |
| 2 | 1 | eleq2d 2302 | . . 3 ⊢ (𝑥 = 𝑌 → (𝑁 ∈ (𝐸‘𝑥) ↔ 𝑁 ∈ (𝐸‘𝑌))) |
| 3 | usgredg2v.a | . . 3 ⊢ 𝐴 = {𝑥 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑥)} | |
| 4 | 2, 3 | elrab2 2975 | . 2 ⊢ (𝑌 ∈ 𝐴 ↔ (𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌))) |
| 5 | usgredg2v.v | . . . . . 6 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 6 | usgredg2v.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 7 | 5, 6 | usgredgreu 16203 | . . . . 5 ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌)) → ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑁, 𝑧}) |
| 8 | prcom 3766 | . . . . . . 7 ⊢ {𝑁, 𝑧} = {𝑧, 𝑁} | |
| 9 | 8 | eqeq2i 2243 | . . . . . 6 ⊢ ((𝐸‘𝑌) = {𝑁, 𝑧} ↔ (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 10 | 9 | reubii 2730 | . . . . 5 ⊢ (∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑁, 𝑧} ↔ ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 11 | 7, 10 | sylib 122 | . . . 4 ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌)) → ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 12 | 11 | 3expb 1231 | . . 3 ⊢ ((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌))) → ∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) |
| 13 | riotacl 6018 | . . 3 ⊢ (∃!𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁} → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) | |
| 14 | 12, 13 | syl 14 | . 2 ⊢ ((𝐺 ∈ USGraph ∧ (𝑌 ∈ dom 𝐸 ∧ 𝑁 ∈ (𝐸‘𝑌))) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) |
| 15 | 4, 14 | sylan2b 287 | 1 ⊢ ((𝐺 ∈ USGraph ∧ 𝑌 ∈ 𝐴) → (℩𝑧 ∈ 𝑉 (𝐸‘𝑌) = {𝑧, 𝑁}) ∈ 𝑉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∃!wreu 2522 {crab 2524 {cpr 3689 dom cdm 4748 ‘cfv 5351 ℩crio 6001 Vtxcvtx 15999 iEdgciedg 16000 USGraphcusgr 16141 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 ax-cnex 8217 ax-resscn 8218 ax-1cn 8219 ax-1re 8220 ax-icn 8221 ax-addcl 8222 ax-addrcl 8223 ax-mulcl 8224 ax-addcom 8226 ax-mulcom 8227 ax-addass 8228 ax-mulass 8229 ax-distr 8230 ax-i2m1 8231 ax-1rid 8233 ax-0id 8234 ax-rnegex 8235 ax-cnre 8237 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-if 3620 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-id 4413 df-iord 4486 df-on 4488 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-riota 6002 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-1o 6646 df-2o 6647 df-er 6766 df-en 6975 df-sub 8445 df-inn 9237 df-2 9295 df-3 9296 df-4 9297 df-5 9298 df-6 9299 df-7 9300 df-8 9301 df-9 9302 df-n0 9496 df-dec 9709 df-ndx 13207 df-slot 13208 df-base 13210 df-edgf 15992 df-vtx 16001 df-iedg 16002 df-edg 16045 df-umgren 16081 df-usgren 16143 |
| This theorem is referenced by: usgredg2vlem2 16210 usgredg2v 16211 |
| Copyright terms: Public domain | W3C validator |