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

Theorem 2pthon3v 29963
Description: For a vertex adjacent to two other vertices there is a simple path of length 2 between these other vertices in a hypergraph. (Contributed by Alexander van der Vekens, 4-Dec-2017.) (Revised by AV, 24-Jan-2021.)
Hypotheses
Ref Expression
2pthon3v.v 𝑉 = (Vtx‘𝐺)
2pthon3v.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
2pthon3v (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶) ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2))
Distinct variable groups:   𝐴,𝑓,𝑝   𝐵,𝑓,𝑝   𝐶,𝑓,𝑝   𝑓,𝐺,𝑝
Allowed substitution hints:   𝐸(𝑓,𝑝)   𝑉(𝑓,𝑝)

Proof of Theorem 2pthon3v
Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2pthon3v.e . . . . . . . . . 10 𝐸 = (Edg‘𝐺)
2 edgval 29066 . . . . . . . . . 10 (Edg‘𝐺) = ran (iEdg‘𝐺)
31, 2eqtri 2765 . . . . . . . . 9 𝐸 = ran (iEdg‘𝐺)
43eleq2i 2833 . . . . . . . 8 ({𝐴, 𝐵} ∈ 𝐸 ↔ {𝐴, 𝐵} ∈ ran (iEdg‘𝐺))
5 2pthon3v.v . . . . . . . . . . 11 𝑉 = (Vtx‘𝐺)
6 eqid 2737 . . . . . . . . . . 11 (iEdg‘𝐺) = (iEdg‘𝐺)
75, 6uhgrf 29079 . . . . . . . . . 10 (𝐺 ∈ UHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
87ffnd 6737 . . . . . . . . 9 (𝐺 ∈ UHGraph → (iEdg‘𝐺) Fn dom (iEdg‘𝐺))
9 fvelrnb 6969 . . . . . . . . 9 ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → ({𝐴, 𝐵} ∈ ran (iEdg‘𝐺) ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵}))
108, 9syl 17 . . . . . . . 8 (𝐺 ∈ UHGraph → ({𝐴, 𝐵} ∈ ran (iEdg‘𝐺) ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵}))
114, 10bitrid 283 . . . . . . 7 (𝐺 ∈ UHGraph → ({𝐴, 𝐵} ∈ 𝐸 ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵}))
123eleq2i 2833 . . . . . . . 8 ({𝐵, 𝐶} ∈ 𝐸 ↔ {𝐵, 𝐶} ∈ ran (iEdg‘𝐺))
13 fvelrnb 6969 . . . . . . . . 9 ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → ({𝐵, 𝐶} ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
148, 13syl 17 . . . . . . . 8 (𝐺 ∈ UHGraph → ({𝐵, 𝐶} ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
1512, 14bitrid 283 . . . . . . 7 (𝐺 ∈ UHGraph → ({𝐵, 𝐶} ∈ 𝐸 ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
1611, 15anbi12d 632 . . . . . 6 (𝐺 ∈ UHGraph → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ (∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
1716adantr 480 . . . . 5 ((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ (∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
1817adantr 480 . . . 4 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ (∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
19 reeanv 3229 . . . 4 (∃𝑖 ∈ dom (iEdg‘𝐺)∃𝑗 ∈ dom (iEdg‘𝐺)(((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) ↔ (∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
2018, 19bitr4di 289 . . 3 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)∃𝑗 ∈ dom (iEdg‘𝐺)(((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
21 df-s2 14887 . . . . . . . 8 ⟨“𝑖𝑗”⟩ = (⟨“𝑖”⟩ ++ ⟨“𝑗”⟩)
2221ovexi 7465 . . . . . . 7 ⟨“𝑖𝑗”⟩ ∈ V
23 df-s3 14888 . . . . . . . 8 ⟨“𝐴𝐵𝐶”⟩ = (⟨“𝐴𝐵”⟩ ++ ⟨“𝐶”⟩)
2423ovexi 7465 . . . . . . 7 ⟨“𝐴𝐵𝐶”⟩ ∈ V
2522, 24pm3.2i 470 . . . . . 6 (⟨“𝑖𝑗”⟩ ∈ V ∧ ⟨“𝐴𝐵𝐶”⟩ ∈ V)
26 eqid 2737 . . . . . . . 8 ⟨“𝐴𝐵𝐶”⟩ = ⟨“𝐴𝐵𝐶”⟩
27 eqid 2737 . . . . . . . 8 ⟨“𝑖𝑗”⟩ = ⟨“𝑖𝑗”⟩
28 simp-4r 784 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → (𝐴𝑉𝐵𝑉𝐶𝑉))
29 3simpb 1150 . . . . . . . . 9 ((𝐴𝐵𝐴𝐶𝐵𝐶) → (𝐴𝐵𝐵𝐶))
3029ad3antlr 731 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → (𝐴𝐵𝐵𝐶))
31 eqimss2 4043 . . . . . . . . . 10 (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} → {𝐴, 𝐵} ⊆ ((iEdg‘𝐺)‘𝑖))
32 eqimss2 4043 . . . . . . . . . 10 (((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶} → {𝐵, 𝐶} ⊆ ((iEdg‘𝐺)‘𝑗))
3331, 32anim12i 613 . . . . . . . . 9 ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → ({𝐴, 𝐵} ⊆ ((iEdg‘𝐺)‘𝑖) ∧ {𝐵, 𝐶} ⊆ ((iEdg‘𝐺)‘𝑗)))
3433adantl 481 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → ({𝐴, 𝐵} ⊆ ((iEdg‘𝐺)‘𝑖) ∧ {𝐵, 𝐶} ⊆ ((iEdg‘𝐺)‘𝑗)))
35 fveqeq2 6915 . . . . . . . . . . . . . 14 (𝑖 = 𝑗 → (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ↔ ((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵}))
3635anbi1d 631 . . . . . . . . . . . . 13 (𝑖 = 𝑗 → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) ↔ (((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
37 eqtr2 2761 . . . . . . . . . . . . . 14 ((((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → {𝐴, 𝐵} = {𝐵, 𝐶})
38 3simpa 1149 . . . . . . . . . . . . . . . . . . . 20 ((𝐴𝑉𝐵𝑉𝐶𝑉) → (𝐴𝑉𝐵𝑉))
39 3simpc 1151 . . . . . . . . . . . . . . . . . . . 20 ((𝐴𝑉𝐵𝑉𝐶𝑉) → (𝐵𝑉𝐶𝑉))
40 preq12bg 4853 . . . . . . . . . . . . . . . . . . . 20 (((𝐴𝑉𝐵𝑉) ∧ (𝐵𝑉𝐶𝑉)) → ({𝐴, 𝐵} = {𝐵, 𝐶} ↔ ((𝐴 = 𝐵𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐵))))
4138, 39, 40syl2anc 584 . . . . . . . . . . . . . . . . . . 19 ((𝐴𝑉𝐵𝑉𝐶𝑉) → ({𝐴, 𝐵} = {𝐵, 𝐶} ↔ ((𝐴 = 𝐵𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐵))))
42 eqneqall 2951 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 = 𝐵 → (𝐴𝐵𝑖𝑗))
4342com12 32 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴𝐵 → (𝐴 = 𝐵𝑖𝑗))
44433ad2ant1 1134 . . . . . . . . . . . . . . . . . . . . . 22 ((𝐴𝐵𝐴𝐶𝐵𝐶) → (𝐴 = 𝐵𝑖𝑗))
4544com12 32 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 = 𝐵 → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
4645adantr 480 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 = 𝐵𝐵 = 𝐶) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
47 eqneqall 2951 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 = 𝐶 → (𝐴𝐶𝑖𝑗))
4847com12 32 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴𝐶 → (𝐴 = 𝐶𝑖𝑗))
49483ad2ant2 1135 . . . . . . . . . . . . . . . . . . . . . 22 ((𝐴𝐵𝐴𝐶𝐵𝐶) → (𝐴 = 𝐶𝑖𝑗))
5049com12 32 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 = 𝐶 → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
5150adantr 480 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 = 𝐶𝐵 = 𝐵) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
5246, 51jaoi 858 . . . . . . . . . . . . . . . . . . 19 (((𝐴 = 𝐵𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐵)) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
5341, 52biimtrdi 253 . . . . . . . . . . . . . . . . . 18 ((𝐴𝑉𝐵𝑉𝐶𝑉) → ({𝐴, 𝐵} = {𝐵, 𝐶} → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗)))
5453com23 86 . . . . . . . . . . . . . . . . 17 ((𝐴𝑉𝐵𝑉𝐶𝑉) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → ({𝐴, 𝐵} = {𝐵, 𝐶} → 𝑖𝑗)))
5554adantl 481 . . . . . . . . . . . . . . . 16 ((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → ({𝐴, 𝐵} = {𝐵, 𝐶} → 𝑖𝑗)))
5655imp 406 . . . . . . . . . . . . . . 15 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ({𝐴, 𝐵} = {𝐵, 𝐶} → 𝑖𝑗))
5756com12 32 . . . . . . . . . . . . . 14 ({𝐴, 𝐵} = {𝐵, 𝐶} → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → 𝑖𝑗))
5837, 57syl 17 . . . . . . . . . . . . 13 ((((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → 𝑖𝑗))
5936, 58biimtrdi 253 . . . . . . . . . . . 12 (𝑖 = 𝑗 → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → 𝑖𝑗)))
6059com23 86 . . . . . . . . . . 11 (𝑖 = 𝑗 → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗)))
61 2a1 28 . . . . . . . . . . 11 (𝑖𝑗 → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗)))
6260, 61pm2.61ine 3025 . . . . . . . . . 10 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗))
6362adantr 480 . . . . . . . . 9 ((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗))
6463imp 406 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → 𝑖𝑗)
65 simplr2 1217 . . . . . . . . 9 ((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) → 𝐴𝐶)
6665adantr 480 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → 𝐴𝐶)
6726, 27, 28, 30, 34, 5, 6, 64, 662pthond 29962 . . . . . . 7 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → ⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩)
68 s2len 14928 . . . . . . 7 (♯‘⟨“𝑖𝑗”⟩) = 2
6967, 68jctir 520 . . . . . 6 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → (⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩ ∧ (♯‘⟨“𝑖𝑗”⟩) = 2))
70 breq12 5148 . . . . . . . 8 ((𝑓 = ⟨“𝑖𝑗”⟩ ∧ 𝑝 = ⟨“𝐴𝐵𝐶”⟩) → (𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ↔ ⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩))
71 fveqeq2 6915 . . . . . . . . 9 (𝑓 = ⟨“𝑖𝑗”⟩ → ((♯‘𝑓) = 2 ↔ (♯‘⟨“𝑖𝑗”⟩) = 2))
7271adantr 480 . . . . . . . 8 ((𝑓 = ⟨“𝑖𝑗”⟩ ∧ 𝑝 = ⟨“𝐴𝐵𝐶”⟩) → ((♯‘𝑓) = 2 ↔ (♯‘⟨“𝑖𝑗”⟩) = 2))
7370, 72anbi12d 632 . . . . . . 7 ((𝑓 = ⟨“𝑖𝑗”⟩ ∧ 𝑝 = ⟨“𝐴𝐵𝐶”⟩) → ((𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2) ↔ (⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩ ∧ (♯‘⟨“𝑖𝑗”⟩) = 2)))
7473spc2egv 3599 . . . . . 6 ((⟨“𝑖𝑗”⟩ ∈ V ∧ ⟨“𝐴𝐵𝐶”⟩ ∈ V) → ((⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩ ∧ (♯‘⟨“𝑖𝑗”⟩) = 2) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2)))
7525, 69, 74mpsyl 68 . . . . 5 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2))
7675ex 412 . . . 4 ((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2)))
7776rexlimdvva 3213 . . 3 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (∃𝑖 ∈ dom (iEdg‘𝐺)∃𝑗 ∈ dom (iEdg‘𝐺)(((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2)))
7820, 77sylbid 240 . 2 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2)))
79783impia 1118 1 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶) ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (♯‘𝑓) = 2))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 848  w3a 1087   = wceq 1540  wex 1779  wcel 2108  wne 2940  wrex 3070  Vcvv 3480  cdif 3948  wss 3951  c0 4333  𝒫 cpw 4600  {csn 4626  {cpr 4628   class class class wbr 5143  dom cdm 5685  ran crn 5686   Fn wfn 6556  cfv 6561  (class class class)co 7431  2c2 12321  chash 14369   ++ cconcat 14608  ⟨“cs1 14633  ⟨“cs2 14880  ⟨“cs3 14881  Vtxcvtx 29013  iEdgciedg 29014  Edgcedg 29064  UHGraphcuhgr 29073  SPathsOncspthson 29733
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231  ax-pre-mulgt0 11232
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-ifp 1064  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-tp 4631  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-card 9979  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-sub 11494  df-neg 11495  df-nn 12267  df-2 12329  df-3 12330  df-n0 12527  df-z 12614  df-uz 12879  df-fz 13548  df-fzo 13695  df-hash 14370  df-word 14553  df-concat 14609  df-s1 14634  df-s2 14887  df-s3 14888  df-edg 29065  df-uhgr 29075  df-wlks 29617  df-wlkson 29618  df-trls 29710  df-trlson 29711  df-spths 29735  df-spthson 29737
This theorem is referenced by:  2pthfrgr  30303
  Copyright terms: Public domain W3C validator