MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  lfgredgge2 Structured version   Visualization version   GIF version

Theorem lfgredgge2 29703
Description: An edge of a loop-free graph has at least two ends. (Contributed by AV, 23-Feb-2021.)
Hypotheses
Ref Expression
lfuhgrnloopv.i 𝐼 = (iEdg‘𝐺)
lfuhgrnloopv.a 𝐴 = dom 𝐼
lfuhgrnloopv.e 𝐸 = {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}
Assertion
Ref Expression
lfgredgge2 ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → 2 ≤ (♯‘(𝐼‘𝑋)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐼   𝑥,𝑉
Allowed substitution hints:   𝐸(𝑥)   𝐺(𝑥)   𝑋(𝑥)

Proof of Theorem lfgredgge2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . . 5 𝐴 = 𝐴
2 lfuhgrnloopv.e . . . . 5 𝐸 = {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)}
31, 2feq23i 6703 . . . 4 (𝐼:𝐴⟶𝐸 ↔ 𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})
43biimpi 219 . . 3 (𝐼:𝐴⟶𝐸 → 𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})
54ffvelcdmda 7084 . 2 ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → (𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)})
6 fveq2 6885 . . . . 5 (𝑦 = (𝐼‘𝑋) → (♯‘𝑦) = (♯‘(𝐼‘𝑋)))
76breq2d 5114 . . . 4 (𝑦 = (𝐼‘𝑋) → (2 ≤ (♯‘𝑦) ↔ 2 ≤ (♯‘(𝐼‘𝑋))))
8 fveq2 6885 . . . . . 6 (𝑥 = 𝑦 → (♯‘𝑥) = (♯‘𝑦))
98breq2d 5114 . . . . 5 (𝑥 = 𝑦 → (2 ≤ (♯‘𝑥) ↔ 2 ≤ (♯‘𝑦)))
109cbvrabv 3422 . . . 4 {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} = {𝑦 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑦)}
117, 10elrab2 3648 . . 3 ((𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ↔ ((𝐼‘𝑋) ∈ 𝒫 𝑉 ∧ 2 ≤ (♯‘(𝐼‘𝑋))))
1211simprbi 503 . 2 ((𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} → 2 ≤ (♯‘(𝐼‘𝑋)))
135, 12syl 18 1 ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → 2 ≤ (♯‘(𝐼‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  𝒫 cpw 4556   class class class wbr 5102  dom cdm 5650  ⟶wf 6534  ‘cfv 6538   ≤ cle 11345  2c2 12398  ♯chash 14475  iEdgciedg 29576
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546
This theorem is used by:  lfgrnloop  29704
  Copyright terms: Public domain W3C validator