Theorem dfsclnbgr6 48956

Description: Alternate definition of a semiclosed neighborhood of a vertex as a union of a semiopen neighborhood and the vertex itself if there is a loop at this vertex. (Contributed by AV, 17-May-2025.)

Hypotheses

Ref	Expression
dfvopnbgr2.v	⊢ 𝑉 = (Vtx‘𝐺)
dfvopnbgr2.e	⊢ 𝐸 = (Edg‘𝐺)
dfvopnbgr2.u	⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))}
dfsclnbgr6.s	⊢ 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}

Assertion

Ref	Expression
dfsclnbgr6	⊢ (𝑁 ∈ 𝑉 → 𝑆 = (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}))

Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝑁,𝑛   𝑒,𝑉,𝑛   𝑛,𝐸   𝑛,𝐺

Allowed substitution hints:   𝑆(𝑒, 𝑛)   𝑈(𝑒, 𝑛)

Proof of Theorem dfsclnbgr6

Step	Hyp	Ref	Expression
1		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) → 𝑛 ∈ 𝑒)
2	1	anim1i 627	. . . . . . . . . 10 ⊢ (((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∧ 𝑛 = 𝑁) → (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))
3	2	olcd 888	. . . . . . . . 9 ⊢ (((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∧ 𝑛 = 𝑁) → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)))
4	3	expcom 419	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))))
5		3anass 1111	. . . . . . . . . . . 12 ⊢ ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ (𝑛 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
6	5	biimpri 231	. . . . . . . . . . 11 ⊢ ((𝑛 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)) → (𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))
7	6	orcd 887	. . . . . . . . . 10 ⊢ ((𝑛 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)) → ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})))
8	7	orcd 887	. . . . . . . . 9 ⊢ ((𝑛 ≠ 𝑁 ∧ (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)) → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)))
9	8	ex 418	. . . . . . . 8 ⊢ (𝑛 ≠ 𝑁 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))))
10	4, 9	pm2.61ine 3038	. . . . . . 7 ⊢ ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)))
11		3simpc 1168	. . . . . . . . . 10 ⊢ ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))
12	11	a1i 11	. . . . . . . . 9 ⊢ (𝑁 ∈ 𝑉 → ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
13		vsnid 4623	. . . . . . . . . . . . . . . 16 ⊢ 𝑛 ∈ {𝑛}
14	13	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝑒 = {𝑛} → 𝑛 ∈ {𝑛})
15		eleq2 2849	. . . . . . . . . . . . . . 15 ⊢ (𝑒 = {𝑛} → (𝑛 ∈ 𝑒 ↔ 𝑛 ∈ {𝑛}))
16	14, 15	mpbird 260	. . . . . . . . . . . . . 14 ⊢ (𝑒 = {𝑛} → 𝑛 ∈ 𝑒)
17	16	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝑛 = 𝑁 ∧ 𝑒 = {𝑛}) → 𝑛 ∈ 𝑒)
18		eleq1 2848	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑁 → (𝑛 ∈ 𝑒 ↔ 𝑁 ∈ 𝑒))
19	18	bicomd 226	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑁 → (𝑁 ∈ 𝑒 ↔ 𝑛 ∈ 𝑒))
20	19	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝑛 = 𝑁 ∧ 𝑒 = {𝑛}) → (𝑁 ∈ 𝑒 ↔ 𝑛 ∈ 𝑒))
21	17, 20	mpbird 260	. . . . . . . . . . . 12 ⊢ ((𝑛 = 𝑁 ∧ 𝑒 = {𝑛}) → 𝑁 ∈ 𝑒)
22	21	adantl 487	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) → 𝑁 ∈ 𝑒)
23	17	adantl 487	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) → 𝑛 ∈ 𝑒)
24	22, 23	jca 521	. . . . . . . . . 10 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))
25	24	ex 418	. . . . . . . . 9 ⊢ (𝑁 ∈ 𝑉 → ((𝑛 = 𝑁 ∧ 𝑒 = {𝑛}) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
26	12, 25	jaod 873	. . . . . . . 8 ⊢ (𝑁 ∈ 𝑉 → (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
27	18	biimpac 484	. . . . . . . . . 10 ⊢ ((𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) → 𝑁 ∈ 𝑒)
28		simpl 488	. . . . . . . . . 10 ⊢ ((𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) → 𝑛 ∈ 𝑒)
29	27, 28	jca 521	. . . . . . . . 9 ⊢ ((𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒))
30	29	a1i 11	. . . . . . . 8 ⊢ (𝑁 ∈ 𝑉 → ((𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
31	26, 30	jaod 873	. . . . . . 7 ⊢ (𝑁 ∈ 𝑉 → ((((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)) → (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)))
32	10, 31	impbid2 229	. . . . . 6 ⊢ (𝑁 ∈ 𝑉 → ((𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))))
33	32	rexbidv 3186	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ ∃𝑒 ∈ 𝐸 (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))))
34		r19.43 3130	. . . . . 6 ⊢ (∃𝑒 ∈ 𝐸 (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)) ↔ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ ∃𝑒 ∈ 𝐸 (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)))
35	34	a1i 11	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 (((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)) ↔ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ ∃𝑒 ∈ 𝐸 (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))))
36		r19.41v 3192	. . . . . . . 8 ⊢ (∃𝑒 ∈ 𝐸 (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) ↔ (∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁))
37	36	biancomi 468	. . . . . . 7 ⊢ (∃𝑒 ∈ 𝐸 (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) ↔ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒))
38	37	a1i 11	. . . . . 6 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁) ↔ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒)))
39	38	orbi2d 929	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → ((∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ ∃𝑒 ∈ 𝐸 (𝑛 ∈ 𝑒 ∧ 𝑛 = 𝑁)) ↔ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒))))
40	33, 35, 39	3bitrd 308	. . . 4 ⊢ (𝑁 ∈ 𝑉 → (∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ↔ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒))))
41	40	rabbidv 3419	. . 3 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)} = {𝑛 ∈ 𝑉 ∣ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒))})
42		unrab 4260	. . . 4 ⊢ ({𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ∪ {𝑛 ∈ 𝑉 ∣ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒)}) = {𝑛 ∈ 𝑉 ∣ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒))}
43		rabsneq 4602	. . . . . 6 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒} = {𝑛 ∈ 𝑉 ∣ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒)})
44	43	eqcomd 2766	. . . . 5 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒)} = {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒})
45	44	uneq2d 4167	. . . 4 ⊢ (𝑁 ∈ 𝑉 → ({𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ∪ {𝑛 ∈ 𝑉 ∣ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒)}) = ({𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}))
46	42, 45	eqtr3id 2809	. . 3 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ (∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛})) ∨ (𝑛 = 𝑁 ∧ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒))} = ({𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}))
47	41, 46	eqtrd 2795	. 2 ⊢ (𝑁 ∈ 𝑉 → {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)} = ({𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}))
48		dfvopnbgr2.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
49		dfsclnbgr6.s	. . 3 ⊢ 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 {𝑁, 𝑛} ⊆ 𝑒}
50		dfvopnbgr2.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
51	48, 49, 50	dfsclnbgr2 48944	. 2 ⊢ (𝑁 ∈ 𝑉 → 𝑆 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 (𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒)})
52		dfvopnbgr2.u	. . . 4 ⊢ 𝑈 = {𝑛 ∈ 𝑉 ∣ (𝑛 ∈ (𝐺 NeighbVtx 𝑁) ∨ ∃𝑒 ∈ 𝐸 (𝑁 = 𝑛 ∧ 𝑒 = {𝑁}))}
53	48, 50, 52	dfvopnbgr2 48951	. . 3 ⊢ (𝑁 ∈ 𝑉 → 𝑈 = {𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))})
54	53	uneq1d 4166	. 2 ⊢ (𝑁 ∈ 𝑉 → (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}) = ({𝑛 ∈ 𝑉 ∣ ∃𝑒 ∈ 𝐸 ((𝑛 ≠ 𝑁 ∧ 𝑁 ∈ 𝑒 ∧ 𝑛 ∈ 𝑒) ∨ (𝑛 = 𝑁 ∧ 𝑒 = {𝑛}))} ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}))
55	47, 51, 54	3eqtr4d 2805	1 ⊢ (𝑁 ∈ 𝑉 → 𝑆 = (𝑈 ∪ {𝑛 ∈ {𝑁} ∣ ∃𝑒 ∈ 𝐸 𝑛 ∈ 𝑒}))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086  {crab 3412   ⊆ wss 3895   ∪ cun 4149  {csn 4583  {cpr 4585  ‘cfv 6538  (class class class)co 7420  Vtxcvtx 29574  Edgcedg 29625   NeighbVtx cnbgr 29913

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-nbgr 29914

This theorem is used by:  dfnbgrss2  48957