Theorem lfgredg2dom 15982

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 2231	. . . . 5 ⊢ 𝐴 = 𝐴
2		lfuhgrnloopv.e	. . . . 5 ⊢ 𝐸 = {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥}
3	1, 2	feq23i 5477	. . . 4 ⊢ (𝐼:𝐴⟶𝐸 ↔ 𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})
4	3	biimpi 120	. . 3 ⊢ (𝐼:𝐴⟶𝐸 → 𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})
5	4	ffvelcdmda 5782	. 2 ⊢ ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → (𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥})
6		breq2 4092	. . . 4 ⊢ (𝑦 = (𝐼‘𝑋) → (2o ≼ 𝑦 ↔ 2o ≼ (𝐼‘𝑋)))
7		breq2 4092	. . . . 5 ⊢ (𝑥 = 𝑦 → (2o ≼ 𝑥 ↔ 2o ≼ 𝑦))
8	7	cbvrabv 2801	. . . 4 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} = {𝑦 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑦}
9	6, 8	elrab2 2965	. . 3 ⊢ ((𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} ↔ ((𝐼‘𝑋) ∈ 𝒫 𝑉 ∧ 2o ≼ (𝐼‘𝑋)))
10	9	simprbi 275	. 2 ⊢ ((𝐼‘𝑋) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ 2o ≼ 𝑥} → 2o ≼ (𝐼‘𝑋))
11	5, 10	syl 14	1 ⊢ ((𝐼:𝐴⟶𝐸 ∧ 𝑋 ∈ 𝐴) → 2o ≼ (𝐼‘𝑋))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1397   ∈ wcel 2202  {crab 2514  𝒫 cpw 3652   class class class wbr 4088  dom cdm 4725  ⟶wf 5322  ‘cfv 5326  2_oc2o 6575   ≼ cdom 6907  iEdgciedg 15863

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334

This theorem is referenced by:  lfgrnloopen  15983