Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  2pthon3v-av Structured version   Visualization version   GIF version

Theorem 2pthon3v-av 41150
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-av.v 𝑉 = (Vtx‘𝐺)
2pthon3v-av.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
2pthon3v-av (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶) ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2))
Distinct variable groups:   𝐴,𝑓,𝑝   𝐵,𝑓,𝑝   𝐶,𝑓,𝑝   𝑓,𝐺,𝑝
Allowed substitution hints:   𝐸(𝑓,𝑝)   𝑉(𝑓,𝑝)

Proof of Theorem 2pthon3v-av
Dummy variables 𝑖 𝑗 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 2pthon3v-av.e . . . . . . . . . 10 𝐸 = (Edg‘𝐺)
2 edgaval 25794 . . . . . . . . . 10 (𝐺 ∈ UHGraph → (Edg‘𝐺) = ran (iEdg‘𝐺))
31, 2syl5eq 2656 . . . . . . . . 9 (𝐺 ∈ UHGraph → 𝐸 = ran (iEdg‘𝐺))
43eleq2d 2673 . . . . . . . 8 (𝐺 ∈ UHGraph → ({𝐴, 𝐵} ∈ 𝐸 ↔ {𝐴, 𝐵} ∈ ran (iEdg‘𝐺)))
5 2pthon3v-av.v . . . . . . . . . . 11 𝑉 = (Vtx‘𝐺)
6 eqid 2610 . . . . . . . . . . 11 (iEdg‘𝐺) = (iEdg‘𝐺)
75, 6uhgrf 25728 . . . . . . . . . 10 (𝐺 ∈ UHGraph → (iEdg‘𝐺):dom (iEdg‘𝐺)⟶(𝒫 𝑉 ∖ {∅}))
87ffnd 5959 . . . . . . . . 9 (𝐺 ∈ UHGraph → (iEdg‘𝐺) Fn dom (iEdg‘𝐺))
9 fvelrnb 6153 . . . . . . . . 9 ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → ({𝐴, 𝐵} ∈ ran (iEdg‘𝐺) ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵}))
108, 9syl 17 . . . . . . . 8 (𝐺 ∈ UHGraph → ({𝐴, 𝐵} ∈ ran (iEdg‘𝐺) ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵}))
114, 10bitrd 267 . . . . . . 7 (𝐺 ∈ UHGraph → ({𝐴, 𝐵} ∈ 𝐸 ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵}))
123eleq2d 2673 . . . . . . . 8 (𝐺 ∈ UHGraph → ({𝐵, 𝐶} ∈ 𝐸 ↔ {𝐵, 𝐶} ∈ ran (iEdg‘𝐺)))
13 fvelrnb 6153 . . . . . . . . 9 ((iEdg‘𝐺) Fn dom (iEdg‘𝐺) → ({𝐵, 𝐶} ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
148, 13syl 17 . . . . . . . 8 (𝐺 ∈ UHGraph → ({𝐵, 𝐶} ∈ ran (iEdg‘𝐺) ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
1512, 14bitrd 267 . . . . . . 7 (𝐺 ∈ UHGraph → ({𝐵, 𝐶} ∈ 𝐸 ↔ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
1611, 15anbi12d 743 . . . . . 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 3086 . . . 4 (∃𝑖 ∈ dom (iEdg‘𝐺)∃𝑗 ∈ dom (iEdg‘𝐺)(((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) ↔ (∃𝑖 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ∃𝑗 ∈ dom (iEdg‘𝐺)((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}))
2018, 19syl6bbr 277 . . 3 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) ↔ ∃𝑖 ∈ dom (iEdg‘𝐺)∃𝑗 ∈ dom (iEdg‘𝐺)(((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
21 df-s2 13444 . . . . . . . 8 ⟨“𝑖𝑗”⟩ = (⟨“𝑖”⟩ ++ ⟨“𝑗”⟩)
22 ovex 6577 . . . . . . . 8 (⟨“𝑖”⟩ ++ ⟨“𝑗”⟩) ∈ V
2321, 22eqeltri 2684 . . . . . . 7 ⟨“𝑖𝑗”⟩ ∈ V
24 df-s3 13445 . . . . . . . 8 ⟨“𝐴𝐵𝐶”⟩ = (⟨“𝐴𝐵”⟩ ++ ⟨“𝐶”⟩)
25 ovex 6577 . . . . . . . 8 (⟨“𝐴𝐵”⟩ ++ ⟨“𝐶”⟩) ∈ V
2624, 25eqeltri 2684 . . . . . . 7 ⟨“𝐴𝐵𝐶”⟩ ∈ V
2723, 26pm3.2i 470 . . . . . 6 (⟨“𝑖𝑗”⟩ ∈ V ∧ ⟨“𝐴𝐵𝐶”⟩ ∈ V)
28 eqid 2610 . . . . . . . 8 ⟨“𝐴𝐵𝐶”⟩ = ⟨“𝐴𝐵𝐶”⟩
29 eqid 2610 . . . . . . . 8 ⟨“𝑖𝑗”⟩ = ⟨“𝑖𝑗”⟩
30 simp-4r 803 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → (𝐴𝑉𝐵𝑉𝐶𝑉))
31 3simpb 1052 . . . . . . . . 9 ((𝐴𝐵𝐴𝐶𝐵𝐶) → (𝐴𝐵𝐵𝐶))
3231ad3antlr 763 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → (𝐴𝐵𝐵𝐶))
33 eqimss2 3621 . . . . . . . . . 10 (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} → {𝐴, 𝐵} ⊆ ((iEdg‘𝐺)‘𝑖))
34 eqimss2 3621 . . . . . . . . . 10 (((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶} → {𝐵, 𝐶} ⊆ ((iEdg‘𝐺)‘𝑗))
3533, 34anim12i 588 . . . . . . . . 9 ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → ({𝐴, 𝐵} ⊆ ((iEdg‘𝐺)‘𝑖) ∧ {𝐵, 𝐶} ⊆ ((iEdg‘𝐺)‘𝑗)))
3635adantl 481 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → ({𝐴, 𝐵} ⊆ ((iEdg‘𝐺)‘𝑖) ∧ {𝐵, 𝐶} ⊆ ((iEdg‘𝐺)‘𝑗)))
37 fveq2 6103 . . . . . . . . . . . . . . 15 (𝑖 = 𝑗 → ((iEdg‘𝐺)‘𝑖) = ((iEdg‘𝐺)‘𝑗))
3837eqeq1d 2612 . . . . . . . . . . . . . 14 (𝑖 = 𝑗 → (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ↔ ((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵}))
3938anbi1d 737 . . . . . . . . . . . . 13 (𝑖 = 𝑗 → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) ↔ (((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})))
40 eqtr2 2630 . . . . . . . . . . . . . 14 ((((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → {𝐴, 𝐵} = {𝐵, 𝐶})
41 3simpa 1051 . . . . . . . . . . . . . . . . . . . 20 ((𝐴𝑉𝐵𝑉𝐶𝑉) → (𝐴𝑉𝐵𝑉))
42 3simpc 1053 . . . . . . . . . . . . . . . . . . . 20 ((𝐴𝑉𝐵𝑉𝐶𝑉) → (𝐵𝑉𝐶𝑉))
43 preq12bg 4326 . . . . . . . . . . . . . . . . . . . 20 (((𝐴𝑉𝐵𝑉) ∧ (𝐵𝑉𝐶𝑉)) → ({𝐴, 𝐵} = {𝐵, 𝐶} ↔ ((𝐴 = 𝐵𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐵))))
4441, 42, 43syl2anc 691 . . . . . . . . . . . . . . . . . . 19 ((𝐴𝑉𝐵𝑉𝐶𝑉) → ({𝐴, 𝐵} = {𝐵, 𝐶} ↔ ((𝐴 = 𝐵𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐵))))
45 eqneqall 2793 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 = 𝐵 → (𝐴𝐵𝑖𝑗))
4645com12 32 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴𝐵 → (𝐴 = 𝐵𝑖𝑗))
47463ad2ant1 1075 . . . . . . . . . . . . . . . . . . . . . 22 ((𝐴𝐵𝐴𝐶𝐵𝐶) → (𝐴 = 𝐵𝑖𝑗))
4847com12 32 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 = 𝐵 → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
4948adantr 480 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 = 𝐵𝐵 = 𝐶) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
50 eqneqall 2793 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝐴 = 𝐶 → (𝐴𝐶𝑖𝑗))
5150com12 32 . . . . . . . . . . . . . . . . . . . . . . 23 (𝐴𝐶 → (𝐴 = 𝐶𝑖𝑗))
52513ad2ant2 1076 . . . . . . . . . . . . . . . . . . . . . 22 ((𝐴𝐵𝐴𝐶𝐵𝐶) → (𝐴 = 𝐶𝑖𝑗))
5352com12 32 . . . . . . . . . . . . . . . . . . . . 21 (𝐴 = 𝐶 → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
5453adantr 480 . . . . . . . . . . . . . . . . . . . 20 ((𝐴 = 𝐶𝐵 = 𝐵) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
5549, 54jaoi 393 . . . . . . . . . . . . . . . . . . 19 (((𝐴 = 𝐵𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐵)) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗))
5644, 55syl6bi 242 . . . . . . . . . . . . . . . . . 18 ((𝐴𝑉𝐵𝑉𝐶𝑉) → ({𝐴, 𝐵} = {𝐵, 𝐶} → ((𝐴𝐵𝐴𝐶𝐵𝐶) → 𝑖𝑗)))
5756com23 84 . . . . . . . . . . . . . . . . 17 ((𝐴𝑉𝐵𝑉𝐶𝑉) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → ({𝐴, 𝐵} = {𝐵, 𝐶} → 𝑖𝑗)))
5857adantl 481 . . . . . . . . . . . . . . . 16 ((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) → ((𝐴𝐵𝐴𝐶𝐵𝐶) → ({𝐴, 𝐵} = {𝐵, 𝐶} → 𝑖𝑗)))
5958imp 444 . . . . . . . . . . . . . . 15 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ({𝐴, 𝐵} = {𝐵, 𝐶} → 𝑖𝑗))
6059com12 32 . . . . . . . . . . . . . 14 ({𝐴, 𝐵} = {𝐵, 𝐶} → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → 𝑖𝑗))
6140, 60syl 17 . . . . . . . . . . . . 13 ((((iEdg‘𝐺)‘𝑗) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → 𝑖𝑗))
6239, 61syl6bi 242 . . . . . . . . . . . 12 (𝑖 = 𝑗 → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → 𝑖𝑗)))
6362com23 84 . . . . . . . . . . 11 (𝑖 = 𝑗 → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗)))
64 2a1 28 . . . . . . . . . . 11 (𝑖𝑗 → (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗)))
6563, 64pm2.61ine 2865 . . . . . . . . . 10 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗))
6665adantr 480 . . . . . . . . 9 ((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → 𝑖𝑗))
6766imp 444 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → 𝑖𝑗)
68 simplr2 1097 . . . . . . . . 9 ((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) → 𝐴𝐶)
6968adantr 480 . . . . . . . 8 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → 𝐴𝐶)
7028, 29, 30, 32, 36, 5, 6, 67, 692pthond 41149 . . . . . . 7 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → ⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩)
71 s2len 13484 . . . . . . 7 (#‘⟨“𝑖𝑗”⟩) = 2
7270, 71jctir 559 . . . . . 6 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → (⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩ ∧ (#‘⟨“𝑖𝑗”⟩) = 2))
73 breq12 4588 . . . . . . . 8 ((𝑓 = ⟨“𝑖𝑗”⟩ ∧ 𝑝 = ⟨“𝐴𝐵𝐶”⟩) → (𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ↔ ⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩))
74 fveq2 6103 . . . . . . . . . 10 (𝑓 = ⟨“𝑖𝑗”⟩ → (#‘𝑓) = (#‘⟨“𝑖𝑗”⟩))
7574eqeq1d 2612 . . . . . . . . 9 (𝑓 = ⟨“𝑖𝑗”⟩ → ((#‘𝑓) = 2 ↔ (#‘⟨“𝑖𝑗”⟩) = 2))
7675adantr 480 . . . . . . . 8 ((𝑓 = ⟨“𝑖𝑗”⟩ ∧ 𝑝 = ⟨“𝐴𝐵𝐶”⟩) → ((#‘𝑓) = 2 ↔ (#‘⟨“𝑖𝑗”⟩) = 2))
7773, 76anbi12d 743 . . . . . . 7 ((𝑓 = ⟨“𝑖𝑗”⟩ ∧ 𝑝 = ⟨“𝐴𝐵𝐶”⟩) → ((𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2) ↔ (⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩ ∧ (#‘⟨“𝑖𝑗”⟩) = 2)))
7877spc2egv 3268 . . . . . 6 ((⟨“𝑖𝑗”⟩ ∈ V ∧ ⟨“𝐴𝐵𝐶”⟩ ∈ V) → ((⟨“𝑖𝑗”⟩(𝐴(SPathsOn‘𝐺)𝐶)⟨“𝐴𝐵𝐶”⟩ ∧ (#‘⟨“𝑖𝑗”⟩) = 2) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2)))
7927, 72, 78mpsyl 66 . . . . 5 (((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) ∧ (((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶})) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2))
8079ex 449 . . . 4 ((((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) ∧ (𝑖 ∈ dom (iEdg‘𝐺) ∧ 𝑗 ∈ dom (iEdg‘𝐺))) → ((((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2)))
8180rexlimdvva 3020 . . 3 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (∃𝑖 ∈ dom (iEdg‘𝐺)∃𝑗 ∈ dom (iEdg‘𝐺)(((iEdg‘𝐺)‘𝑖) = {𝐴, 𝐵} ∧ ((iEdg‘𝐺)‘𝑗) = {𝐵, 𝐶}) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2)))
8220, 81sylbid 229 . 2 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶)) → (({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2)))
83823impia 1253 1 (((𝐺 ∈ UHGraph ∧ (𝐴𝑉𝐵𝑉𝐶𝑉)) ∧ (𝐴𝐵𝐴𝐶𝐵𝐶) ∧ ({𝐴, 𝐵} ∈ 𝐸 ∧ {𝐵, 𝐶} ∈ 𝐸)) → ∃𝑓𝑝(𝑓(𝐴(SPathsOn‘𝐺)𝐶)𝑝 ∧ (#‘𝑓) = 2))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wo 382  wa 383  w3a 1031   = wceq 1475  wex 1695  wcel 1977  wne 2780  wrex 2897  Vcvv 3173  cdif 3537  wss 3540  c0 3874  𝒫 cpw 4108  {csn 4125  {cpr 4127   class class class wbr 4583  dom cdm 5038  ran crn 5039   Fn wfn 5799  cfv 5804  (class class class)co 6549  2c2 10947  #chash 12979   ++ cconcat 13148  ⟨“cs1 13149  ⟨“cs2 13437  ⟨“cs3 13438  Vtxcvtx 25673  iEdgciedg 25674   UHGraph cuhgr 25722  Edgcedga 25792  SPathsOncspthson 40922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-ifp 1007  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-pm 7747  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-3 10957  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-fzo 12335  df-hash 12980  df-word 13154  df-concat 13156  df-s1 13157  df-s2 13444  df-s3 13445  df-uhgr 25724  df-edga 25793  df-1wlks 40800  df-wlkson 40802  df-trls 40901  df-trlson 40902  df-pths 40923  df-spths 40924  df-spthson 40926
This theorem is referenced by:  2pthfrgr  41454
  Copyright terms: Public domain W3C validator