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

Theorem upgrm 15957
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 15955 . . . . 5 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) → 𝐸:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
43ffvelcdmda 5782 . . . 4 (((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴) ∧ 𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
543impa 1220 . . 3 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → (𝐸𝐹) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)})
6 breq1 4091 . . . . 5 (𝑥 = (𝐸𝐹) → (𝑥 ≈ 1o ↔ (𝐸𝐹) ≈ 1o))
7 breq1 4091 . . . . 5 (𝑥 = (𝐸𝐹) → (𝑥 ≈ 2o ↔ (𝐸𝐹) ≈ 2o))
86, 7orbi12d 800 . . . 4 (𝑥 = (𝐸𝐹) → ((𝑥 ≈ 1o𝑥 ≈ 2o) ↔ ((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o)))
98elrab 2962 . . 3 ((𝐸𝐹) ∈ {𝑥 ∈ 𝒫 𝑉 ∣ (𝑥 ≈ 1o𝑥 ≈ 2o)} ↔ ((𝐸𝐹) ∈ 𝒫 𝑉 ∧ ((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o)))
105, 9sylib 122 . 2 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → ((𝐸𝐹) ∈ 𝒫 𝑉 ∧ ((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o)))
11 en1m 6979 . . 3 ((𝐸𝐹) ≈ 1o → ∃𝑗 𝑗 ∈ (𝐸𝐹))
12 en2m 6999 . . 3 ((𝐸𝐹) ≈ 2o → ∃𝑗 𝑗 ∈ (𝐸𝐹))
1311, 12jaoi 723 . 2 (((𝐸𝐹) ≈ 1o ∨ (𝐸𝐹) ≈ 2o) → ∃𝑗 𝑗 ∈ (𝐸𝐹))
1410, 13simpl2im 386 1 ((𝐺 ∈ UPGraph ∧ 𝐸 Fn 𝐴𝐹𝐴) → ∃𝑗 𝑗 ∈ (𝐸𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 715  w3a 1004   = wceq 1397  wex 1540  wcel 2202  {crab 2514  𝒫 cpw 3652   class class class wbr 4088   Fn wfn 5321  cfv 5326  1oc1o 6575  2oc2o 6576  cen 6907  Vtxcvtx 15869  iEdgciedg 15870  UPGraphcupgr 15948
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 619  ax-in2 620  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-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  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-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-1o 6582  df-2o 6583  df-en 6910  df-sub 8352  df-inn 9144  df-2 9202  df-3 9203  df-4 9204  df-5 9205  df-6 9206  df-7 9207  df-8 9208  df-9 9209  df-n0 9403  df-dec 9612  df-ndx 13090  df-slot 13091  df-base 13093  df-edgf 15862  df-vtx 15871  df-iedg 15872  df-upgren 15950
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator