Theorem clos1basesuc 5882

Description: A member of a closure is either in the base set or connected to another member by R. Theorem IX.5.16 of [Rosser] p. 248. (Contributed by SF, 13-Feb-2015.)

Hypotheses

Ref	Expression
clos1basesuc.1	|- S e. _V
clos1basesuc.2	|- R e. _V
clos1basesuc.3	|- C = Clos1 (S, R)

Assertion

Ref	Expression
clos1basesuc	|- (A e. C <-> (A e. S \/ E.x e. C xRA))

Distinct variable groups:   x,A   x,C   x,R

Allowed substitution hint:   S(x)

Proof of Theorem clos1basesuc

Dummy variables y w z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		clos1basesuc.1	. . 3 |- S e. _V
2		clos1basesuc.2	. . 3 |- R e. _V
3		clos1basesuc.3	. . 3 |- C = Clos1 (S, R)
4		abid2 2470	. . . . . . 7 |- {y | y e. S} = S
5	4	eqcomi 2357	. . . . . 6 |- S = {y | y e. S}
6		df-ima 4727	. . . . . 6 |- (R"C) = {y | E.x e. C xRy}
7	5, 6	uneq12i 3416	. . . . 5 |- (S u. (R"C)) = ({y | y e. S} u. {y | E.x e. C xRy})
8		unab 3521	. . . . 5 |- ({y | y e. S} u. {y | E.x e. C xRy}) = {y | (y e. S \/ E.x e. C xRy)}
9	7, 8	eqtri 2373	. . . 4 |- (S u. (R"C)) = {y | (y e. S \/ E.x e. C xRy)}
10	1, 2	clos1ex 5876	. . . . . . 7 |- Clos1 (S, R) e. _V
11	3, 10	eqeltri 2423	. . . . . 6 |- C e. _V
12	2, 11	imaex 4747	. . . . 5 |- (R"C) e. _V
13	1, 12	unex 4106	. . . 4 |- (S u. (R"C)) e. _V
14	9, 13	eqeltrri 2424	. . 3 |- {y | (y e. S \/ E.x e. C xRy)} e. _V
15		eleq1 2413	. . . 4 |- (y = z -> (y e. S <-> z e. S))
16		breq2 4643	. . . . 5 |- (y = z -> (xRy <-> xRz))
17	16	rexbidv 2635	. . . 4 |- (y = z -> (E.x e. C xRy <-> E.x e. C xRz))
18	15, 17	orbi12d 690	. . 3 |- (y = z -> ((y e. S \/ E.x e. C xRy) <-> (z e. S \/ E.x e. C xRz)))
19		eleq1 2413	. . . 4 |- (y = w -> (y e. S <-> w e. S))
20		breq2 4643	. . . . 5 |- (y = w -> (xRy <-> xRw))
21	20	rexbidv 2635	. . . 4 |- (y = w -> (E.x e. C xRy <-> E.x e. C xRw))
22	19, 21	orbi12d 690	. . 3 |- (y = w -> ((y e. S \/ E.x e. C xRy) <-> (w e. S \/ E.x e. C xRw)))
23		eleq1 2413	. . . 4 |- (y = A -> (y e. S <-> A e. S))
24		breq2 4643	. . . . 5 |- (y = A -> (xRy <-> xRA))
25	24	rexbidv 2635	. . . 4 |- (y = A -> (E.x e. C xRy <-> E.x e. C xRA))
26	23, 25	orbi12d 690	. . 3 |- (y = A -> ((y e. S \/ E.x e. C xRy) <-> (A e. S \/ E.x e. C xRA)))
27		orc 374	. . 3 |- (y e. S -> (y e. S \/ E.x e. C xRy))
28	3	clos1base 5878	. . . . . . . . . 10 |- S C_ C
29	28	sseli 3269	. . . . . . . . 9 |- (z e. S -> z e. C)
30		breq1 4642	. . . . . . . . . . 11 |- (y = z -> (yRw <-> zRw))
31	30	rspcev 2955	. . . . . . . . . 10 |- ((z e. C /\ zRw) -> E.y e. C yRw)
32	31	ex 423	. . . . . . . . 9 |- (z e. C -> (zRw -> E.y e. C yRw))
33	29, 32	syl 15	. . . . . . . 8 |- (z e. S -> (zRw -> E.y e. C yRw))
34	3	clos1conn 5879	. . . . . . . . . 10 |- ((x e. C /\ xRz) -> z e. C)
35	34, 32	syl 15	. . . . . . . . 9 |- ((x e. C /\ xRz) -> (zRw -> E.y e. C yRw))
36	35	rexlimiva 2733	. . . . . . . 8 |- (E.x e. C xRz -> (zRw -> E.y e. C yRw))
37	33, 36	jaoi 368	. . . . . . 7 |- ((z e. S \/ E.x e. C xRz) -> (zRw -> E.y e. C yRw))
38	37	impcom 419	. . . . . 6 |- ((zRw /\ (z e. S \/ E.x e. C xRz)) -> E.y e. C yRw)
39		breq1 4642	. . . . . . 7 |- (x = y -> (xRw <-> yRw))
40	39	cbvrexv 2836	. . . . . 6 |- (E.x e. C xRw <-> E.y e. C yRw)
41	38, 40	sylibr 203	. . . . 5 |- ((zRw /\ (z e. S \/ E.x e. C xRz)) -> E.x e. C xRw)
42	41	olcd 382	. . . 4 |- ((zRw /\ (z e. S \/ E.x e. C xRz)) -> (w e. S \/ E.x e. C xRw))
43	42	3adant1 973	. . 3 |- ((z e. C /\ zRw /\ (z e. S \/ E.x e. C xRz)) -> (w e. S \/ E.x e. C xRw))
44	1, 2, 3, 14, 18, 22, 26, 27, 43	clos1is 5881	. 2 |- (A e. C -> (A e. S \/ E.x e. C xRA))
45	28	sseli 3269	. . 3 |- (A e. S -> A e. C)
46	3	clos1conn 5879	. . . 4 |- ((x e. C /\ xRA) -> A e. C)
47	46	rexlimiva 2733	. . 3 |- (E.x e. C xRA -> A e. C)
48	45, 47	jaoi 368	. 2 |- ((A e. S \/ E.x e. C xRA) -> A e. C)
49	44, 48	impbii 180	1 |- (A e. C <-> (A e. S \/ E.x e. C xRA))

Syntax hints:   -> wi 4   <-> wb 176   \/ wo 357   /\ wa 358   = wceq 1642   e. wcel 1710  {cab 2339  E.wrex 2615  _Vcvv 2859   u. cun 3207   class class class wbr 4639  "cima 4722   Clos1 cclos1 5872

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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-1st 4723  df-swap 4724  df-sset 4725  df-co 4726  df-ima 4727  df-si 4728  df-id 4767  df-xp 4784  df-cnv 4785  df-rn 4786  df-dm 4787  df-res 4788  df-2nd 4797  df-txp 5736  df-fix 5740  df-ins2 5750  df-ins3 5752  df-image 5754  df-clos1 5873

This theorem is referenced by:  clos1baseima  5883  clos1basesucg  5884