Theorem lfgredg2dom 16253

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	⊢ 𝐸 = {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}

Assertion

Ref	Expression
lfgredg2dom	⊢ ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → 2o ≼ (𝐼‘𝑋))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐼   𝑥,𝑉

Allowed substitution hints:   𝐸(𝑥)   𝐺(𝑥)   𝑋(𝑥)

Proof of Theorem lfgredg2dom

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2234	. . . . 5 ⊢ 𝐴 = 𝐴
2		lfuhgrnloopv.e	. . . . 5 ⊢ 𝐸 = {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}
3	1, 2	feq23i 5508	. . . 4 ⊢ (𝐼:𝐴⟶𝐸 ↔ 𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})
4	3	biimpi 120	. . 3 ⊢ (𝐼:𝐴⟶𝐸 → 𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})
5	4	ffvelcdmda 5817	. 2 ⊢ ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → (𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})
6		breq2 4118	. . . 4 ⊢ (𝑦 = (𝐼‘𝑋) → (2o ≼ 𝑦 ↔ 2o ≼ (𝐼‘𝑋)))
7		breq2 4118	. . . . 5 ⊢ (𝑥 = 𝑦 → (2o ≼ 𝑥 ↔ 2o ≼ 𝑦))
8	7	cbvrabv 2814	. . . 4 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} = {𝑦 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑦}
9	6, 8	elrab2 2979	. . 3 ⊢ ((𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} ↔ ((𝐼‘𝑋) ∈ 𝒫 𝑉 ∧ 2o ≼ (𝐼‘𝑋)))
10	9	simprbi 275	. 2 ⊢ ((𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} → 2o ≼ (𝐼‘𝑋))
11	5, 10	syl 14	1 ⊢ ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → 2o ≼ (𝐼‘𝑋))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1398   ∈ wcel 2205  {crab 2526  𝒫 cpw 3674   class class class wbr 4114  dom cdm 4754  ⟶wf 5353  ‘cfv 5357  2_oc2o 6654   ≼ cdom 6987  iEdgciedg 16134

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-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-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365

This theorem is referenced by:  lfgrnloopen  16254