Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > 1hegrlfgr | Structured version Visualization version GIF version |
Description: A graph 𝐺 with one hyperedge joining at least two vertices is a loop-free graph. (Contributed by AV, 23-Feb-2021.) |
Ref | Expression |
---|---|
1hegrlfgr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
1hegrlfgr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
1hegrlfgr.c | ⊢ (𝜑 → 𝐶 ∈ 𝑉) |
1hegrlfgr.n | ⊢ (𝜑 → 𝐵 ≠ 𝐶) |
1hegrlfgr.x | ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉) |
1hegrlfgr.i | ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) |
1hegrlfgr.e | ⊢ (𝜑 → {𝐵, 𝐶} ⊆ 𝐸) |
Ref | Expression |
---|---|
1hegrlfgr | ⊢ (𝜑 → (iEdg‘𝐺):{𝐴}⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 1hegrlfgr.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
2 | 1hegrlfgr.x | . . . . 5 ⊢ (𝜑 → 𝐸 ∈ 𝒫 𝑉) | |
3 | f1osng 6654 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐸 ∈ 𝒫 𝑉) → {〈𝐴, 𝐸〉}:{𝐴}–1-1-onto→{𝐸}) | |
4 | 1, 2, 3 | syl2anc 586 | . . . 4 ⊢ (𝜑 → {〈𝐴, 𝐸〉}:{𝐴}–1-1-onto→{𝐸}) |
5 | f1of 6614 | . . . 4 ⊢ ({〈𝐴, 𝐸〉}:{𝐴}–1-1-onto→{𝐸} → {〈𝐴, 𝐸〉}:{𝐴}⟶{𝐸}) | |
6 | 4, 5 | syl 17 | . . 3 ⊢ (𝜑 → {〈𝐴, 𝐸〉}:{𝐴}⟶{𝐸}) |
7 | 1hegrlfgr.e | . . . . . . 7 ⊢ (𝜑 → {𝐵, 𝐶} ⊆ 𝐸) | |
8 | 1hegrlfgr.b | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
9 | prid1g 4695 | . . . . . . . 8 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ {𝐵, 𝐶}) | |
10 | 8, 9 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ {𝐵, 𝐶}) |
11 | 7, 10 | sseldd 3967 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝐸) |
12 | 1hegrlfgr.c | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑉) | |
13 | prid2g 4696 | . . . . . . . 8 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ {𝐵, 𝐶}) | |
14 | 12, 13 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ {𝐵, 𝐶}) |
15 | 7, 14 | sseldd 3967 | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ 𝐸) |
16 | 1hegrlfgr.n | . . . . . 6 ⊢ (𝜑 → 𝐵 ≠ 𝐶) | |
17 | 2, 11, 15, 16 | nehash2 13831 | . . . . 5 ⊢ (𝜑 → 2 ≤ (♯‘𝐸)) |
18 | fveq2 6669 | . . . . . . 7 ⊢ (𝑥 = 𝐸 → (♯‘𝑥) = (♯‘𝐸)) | |
19 | 18 | breq2d 5077 | . . . . . 6 ⊢ (𝑥 = 𝐸 → (2 ≤ (♯‘𝑥) ↔ 2 ≤ (♯‘𝐸))) |
20 | 19 | elrab 3679 | . . . . 5 ⊢ (𝐸 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ↔ (𝐸 ∈ 𝒫 𝑉 ∧ 2 ≤ (♯‘𝐸))) |
21 | 2, 17, 20 | sylanbrc 585 | . . . 4 ⊢ (𝜑 → 𝐸 ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) |
22 | 21 | snssd 4741 | . . 3 ⊢ (𝜑 → {𝐸} ⊆ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) |
23 | 6, 22 | fssd 6527 | . 2 ⊢ (𝜑 → {〈𝐴, 𝐸〉}:{𝐴}⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) |
24 | 1hegrlfgr.i | . . 3 ⊢ (𝜑 → (iEdg‘𝐺) = {〈𝐴, 𝐸〉}) | |
25 | 24 | feq1d 6498 | . 2 ⊢ (𝜑 → ((iEdg‘𝐺):{𝐴}⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ↔ {〈𝐴, 𝐸〉}:{𝐴}⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})) |
26 | 23, 25 | mpbird 259 | 1 ⊢ (𝜑 → (iEdg‘𝐺):{𝐴}⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 {crab 3142 ⊆ wss 3935 𝒫 cpw 4538 {csn 4566 {cpr 4568 〈cop 4572 class class class wbr 5065 ⟶wf 6350 –1-1-onto→wf1o 6353 ‘cfv 6354 ≤ cle 10675 2c2 11691 ♯chash 13689 iEdgciedg 26781 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5189 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-cnex 10592 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-tp 4571 df-op 4573 df-uni 4838 df-int 4876 df-iun 4920 df-br 5066 df-opab 5128 df-mpt 5146 df-tr 5172 df-id 5459 df-eprel 5464 df-po 5473 df-so 5474 df-fr 5513 df-we 5515 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-pred 6147 df-ord 6193 df-on 6194 df-lim 6195 df-suc 6196 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-om 7580 df-1st 7688 df-2nd 7689 df-wrecs 7946 df-recs 8007 df-rdg 8045 df-1o 8101 df-oadd 8105 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-fin 8512 df-dju 9329 df-card 9367 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 df-nn 11638 df-2 11699 df-n0 11897 df-xnn0 11967 df-z 11981 df-uz 12243 df-fz 12892 df-hash 13690 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |