ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  upgrm GIF version

Theorem upgrm 16324
Description: An edge is an inhabited subset of vertices. (Contributed by Mario Carneiro, 11-Mar-2015.) (Revised by AV, 10-Oct-2020.)
Hypotheses
Ref Expression
isupgr.v 𝑉 = (Vtx‘𝐺)
isupgr.e 𝐸 = (iEdg‘𝐺)
Assertion
Ref Expression
upgrm ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → ∃𝑗 𝑗 ∈ (𝐸𝐹))
Distinct variable groups:   𝑗,𝐸   𝑗,𝐹
Allowed substitution hints:   𝐴(𝑗)   𝐺(𝑗)   𝑉(𝑗)

Proof of Theorem upgrm
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 isupgr.v . . . . . 6 𝑉 = (Vtx‘𝐺)
2 isupgr.e . . . . . 6 𝐸 = (iEdg‘𝐺)
31, 2upgrfnen 16322 . . . . 5 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
43ffvelcdmda 5837 . . . 4 (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
543impa 1225 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
6 breq1 4131 . . . . 5 (𝑥 = (𝐸𝐹) → (𝑥 ≈ 1o ↔ (𝐸𝐹) ≈ 1o))
7 breq1 4131 . . . . 5 (𝑥 = (𝐸𝐹) → (𝑥 ≈ 2o ↔ (𝐸𝐹) ≈ 2o))
86, 7orbi12d 805 . . . 4 (𝑥 = (𝐸𝐹) → ((𝑥 ≈ 1o𝑥 ≈ 2o) ↔ ((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o)))
98elrab 2982 . . 3 ((𝐸𝐹) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} ↔ ((𝐸𝐹) ∈ 𝒫 𝑉 ∧ ((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o)))
105, 9sylib 122 . 2 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → ((𝐸𝐹) ∈ 𝒫 𝑉 ∧ ((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o)))
11 en1m 7086 . . 3 ((𝐸𝐹) ≈ 1o → ∃𝑗 𝑗 ∈ (𝐸𝐹))
12 en2m 7107 . . 3 ((𝐸𝐹) ≈ 2o → ∃𝑗 𝑗 ∈ (𝐸𝐹))
1311, 12jaoi 728 . 2 (((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o) → ∃𝑗 𝑗 ∈ (𝐸𝐹))
1410, 13simpl2im 390 1 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → ∃𝑗 𝑗 ∈ (𝐸𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 720  w3a 1009   = wceq 1402  wex 1545  wcel 2209  {crab 2532  𝒫 cpw 3688   class class class wbr 4128   Fn wfn 5370  cfv 5375  1oc1o 6674  2oc2o 6675  cen 7014  Vtxcvtx 16236  iEdgciedg 16237  UPGraphcupgr 16315
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-mulcom 8274  ax-addass 8275  ax-mulass 8276  ax-distr 8277  ax-i2m1 8278  ax-1rid 8280  ax-0id 8281  ax-rnegex 8282  ax-cnre 8284
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-suc 4514  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-1o 6681  df-2o 6682  df-en 7017  df-sub 8493  df-inn 9288  df-2 9346  df-3 9347  df-4 9348  df-5 9349  df-6 9350  df-7 9351  df-8 9352  df-9 9353  df-n0 9547  df-dec 9761  df-ndx 13338  df-slot 13339  df-base 13341  df-edgf 16229  df-vtx 16238  df-iedg 16239  df-upgren 16317
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator