Theorem connexrd 5930

Description: Deduce connectivity from its properties. (Contributed by SF, 12-Mar-2015.)

Hypotheses

Ref	Expression
connexrd.1	|- (ph -> R e. V)
connexrd.2	|- (ph -> A e. W)
connexrd.3	|- ((ph /\ x e. A /\ y e. A) -> (xRy \/ yRx))

Assertion

Ref	Expression
connexrd	|- (ph -> R Connex A)

Distinct variable groups:   x,A,y   ph,x,y   x,R,y

Allowed substitution hints:   V(x,y)   W(x,y)

Proof of Theorem connexrd

Dummy variables a r are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		connexrd.3	. . . 4 |- ((ph /\ x e. A /\ y e. A) -> (xRy \/ yRx))
2	1	3expib 1154	. . 3 |- (ph -> ((x e. A /\ y e. A) -> (xRy \/ yRx)))
3	2	ralrimivv 2705	. 2 |- (ph -> A.x e. A A.y e. A (xRy \/ yRx))
4		connexrd.1	. . 3 |- (ph -> R e. V)
5		connexrd.2	. . 3 |- (ph -> A e. W)
6		breq 4641	. . . . . 6 |- (r = R -> (xry <-> xRy))
7		breq 4641	. . . . . 6 |- (r = R -> (yrx <-> yRx))
8	6, 7	orbi12d 690	. . . . 5 |- (r = R -> ((xry \/ yrx) <-> (xRy \/ yRx)))
9	8	2ralbidv 2656	. . . 4 |- (r = R -> (A.x e. a A.y e. a (xry \/ yrx) <-> A.x e. a A.y e. a (xRy \/ yRx)))
10		raleq 2807	. . . . 5 |- (a = A -> (A.y e. a (xRy \/ yRx) <-> A.y e. A (xRy \/ yRx)))
11	10	raleqbi1dv 2815	. . . 4 |- (a = A -> (A.x e. a A.y e. a (xRy \/ yRx) <-> A.x e. A A.y e. A (xRy \/ yRx)))
12		df-connex 5903	. . . 4 |- Connex = {<.r, a>. | A.x e. a A.y e. a (xry \/ yrx)}
13	9, 11, 12	brabg 4706	. . 3 |- ((R e. V /\ A e. W) -> (R Connex A <-> A.x e. A A.y e. A (xRy \/ yRx)))
14	4, 5, 13	syl2anc 642	. 2 |- (ph -> (R Connex A <-> A.x e. A A.y e. A (xRy \/ yRx)))
15	3, 14	mpbird 223	1 |- (ph -> R Connex A)

Syntax hints:   -> wi 4   <-> wb 176   \/ wo 357   /\ w3a 934   = wceq 1642   e. wcel 1710  A.wral 2614   class class class wbr 4639   Connex cconnex 5892

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4078  ax-xp 4079  ax-cnv 4080  ax-1c 4081  ax-sset 4082  ax-si 4083  ax-ins2 4084  ax-ins3 4085  ax-typlower 4086  ax-sn 4087

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ne 2518  df-ral 2619  df-rex 2620  df-reu 2621  df-rmo 2622  df-rab 2623  df-v 2861  df-sbc 3047  df-nin 3211  df-compl 3212  df-in 3213  df-un 3214  df-dif 3215  df-symdif 3216  df-ss 3259  df-pss 3261  df-nul 3551  df-if 3663  df-pw 3724  df-sn 3741  df-pr 3742  df-uni 3892  df-int 3927  df-opk 4058  df-1c 4136  df-pw1 4137  df-uni1 4138  df-xpk 4185  df-cnvk 4186  df-ins2k 4187  df-ins3k 4188  df-imak 4189  df-cok 4190  df-p6 4191  df-sik 4192  df-ssetk 4193  df-imagek 4194  df-idk 4195  df-iota 4339  df-0c 4377  df-addc 4378  df-nnc 4379  df-fin 4380  df-lefin 4440  df-ltfin 4441  df-ncfin 4442  df-tfin 4443  df-evenfin 4444  df-oddfin 4445  df-sfin 4446  df-spfin 4447  df-phi 4565  df-op 4566  df-proj1 4567  df-proj2 4568  df-opab 4623  df-br 4640  df-connex 5903

This theorem is referenced by:  sod  5937  connex0  5940