Theorem sadcp1 16384

Description: The carry sequence (which is a sequence of wffs, encoded as 1_o and ∅) is defined recursively as the carry operation applied to the previous carry and the two current inputs. (Contributed by Mario Carneiro, 5-Sep-2016.)

Hypotheses

Ref	Expression
sadval.a	⊢ (𝜑 → 𝐴 ⊆ ℕ0)
sadval.b	⊢ (𝜑 → 𝐵 ⊆ ℕ0)
sadval.c	⊢ 𝐶 = seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
sadcp1.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)

Assertion

Ref	Expression
sadcp1	⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁))))

Distinct variable groups:   𝑚,𝑐,𝑛   𝐴,𝑐,𝑚   𝐵,𝑐,𝑚   𝑛,𝑁

Allowed substitution hints:   𝜑(𝑚,𝑛,𝑐)   𝐴(𝑛)   𝐵(𝑛)   𝐶(𝑚,𝑛,𝑐)   𝑁(𝑚,𝑐)

Proof of Theorem sadcp1

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sadcp1.n	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℕ0)
2		nn0uz 12791	. . . . . . 7 ⊢ ℕ0 = (ℤ≥‘0)
3	1, 2	eleqtrdi 2845	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0))
4		seqp1 13941	. . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘0) → (seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘(𝑁 + 1)) = ((seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1))))
5	3, 4	syl 17	. . . . 5 ⊢ (𝜑 → (seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘(𝑁 + 1)) = ((seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1))))
6		sadval.c	. . . . . 6 ⊢ 𝐶 = seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))
7	6	fveq1i 6834	. . . . 5 ⊢ (𝐶‘(𝑁 + 1)) = (seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘(𝑁 + 1))
8	6	fveq1i 6834	. . . . . 6 ⊢ (𝐶‘𝑁) = (seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘𝑁)
9	8	oveq1i 7368	. . . . 5 ⊢ ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1))) = ((seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)))
10	5, 7, 9	3eqtr4g 2795	. . . 4 ⊢ (𝜑 → (𝐶‘(𝑁 + 1)) = ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1))))
11		peano2nn0 12443	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
12		eqeq1 2739	. . . . . . . . 9 ⊢ (𝑛 = (𝑁 + 1) → (𝑛 = 0 ↔ (𝑁 + 1) = 0))
13		oveq1 7365	. . . . . . . . 9 ⊢ (𝑛 = (𝑁 + 1) → (𝑛 − 1) = ((𝑁 + 1) − 1))
14	12, 13	ifbieq2d 4505	. . . . . . . 8 ⊢ (𝑛 = (𝑁 + 1) → if(𝑛 = 0, ∅, (𝑛 − 1)) = if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)))
15		eqid 2735	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))
16		0ex 5251	. . . . . . . . 9 ⊢ ∅ ∈ V
17		ovex 7391	. . . . . . . . 9 ⊢ ((𝑁 + 1) − 1) ∈ V
18	16, 17	ifex 4529	. . . . . . . 8 ⊢ if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)) ∈ V
19	14, 15, 18	fvmpt 6940	. . . . . . 7 ⊢ ((𝑁 + 1) ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)) = if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)))
20	1, 11, 19	3syl 18	. . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)) = if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)))
21		nn0p1nn 12442	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
22	1, 21	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
23	22	nnne0d 12197	. . . . . . 7 ⊢ (𝜑 → (𝑁 + 1) ≠ 0)
24		ifnefalse 4490	. . . . . . 7 ⊢ ((𝑁 + 1) ≠ 0 → if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)) = ((𝑁 + 1) − 1))
25	23, 24	syl 17	. . . . . 6 ⊢ (𝜑 → if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)) = ((𝑁 + 1) − 1))
26	1	nn0cnd 12466	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
27		1cnd 11129	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
28	26, 27	pncand 11495	. . . . . 6 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁)
29	20, 25, 28	3eqtrd 2774	. . . . 5 ⊢ (𝜑 → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)) = 𝑁)
30	29	oveq2d 7374	. . . 4 ⊢ (𝜑 → ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1))) = ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))𝑁))
31		sadval.a	. . . . . . 7 ⊢ (𝜑 → 𝐴 ⊆ ℕ0)
32		sadval.b	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ ℕ0)
33	31, 32, 6	sadcf 16382	. . . . . 6 ⊢ (𝜑 → 𝐶:ℕ0⟶2o)
34	33, 1	ffvelcdmd 7030	. . . . 5 ⊢ (𝜑 → (𝐶‘𝑁) ∈ 2o)
35		simpr 484	. . . . . . . . 9 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → 𝑦 = 𝑁)
36	35	eleq1d 2820	. . . . . . . 8 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (𝑦 ∈ 𝐴 ↔ 𝑁 ∈ 𝐴))
37	35	eleq1d 2820	. . . . . . . 8 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (𝑦 ∈ 𝐵 ↔ 𝑁 ∈ 𝐵))
38		simpl 482	. . . . . . . . 9 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → 𝑥 = (𝐶‘𝑁))
39	38	eleq2d 2821	. . . . . . . 8 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (∅ ∈ 𝑥 ↔ ∅ ∈ (𝐶‘𝑁)))
40	36, 37, 39	cadbi123d 1612	. . . . . . 7 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁))))
41	40	ifbid 4502	. . . . . 6 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → if(cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
42		biidd 262	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (𝑚 ∈ 𝐴 ↔ 𝑚 ∈ 𝐴))
43		biidd 262	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (𝑚 ∈ 𝐵 ↔ 𝑚 ∈ 𝐵))
44		eleq2w 2819	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (∅ ∈ 𝑐 ↔ ∅ ∈ 𝑥))
45	42, 43, 44	cadbi123d 1612	. . . . . . . 8 ⊢ (𝑐 = 𝑥 → (cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐) ↔ cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥)))
46	45	ifbid 4502	. . . . . . 7 ⊢ (𝑐 = 𝑥 → if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅) = if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅))
47		eleq1w 2818	. . . . . . . . 9 ⊢ (𝑚 = 𝑦 → (𝑚 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
48		eleq1w 2818	. . . . . . . . 9 ⊢ (𝑚 = 𝑦 → (𝑚 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
49		biidd 262	. . . . . . . . 9 ⊢ (𝑚 = 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝑥))
50	47, 48, 49	cadbi123d 1612	. . . . . . . 8 ⊢ (𝑚 = 𝑦 → (cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥) ↔ cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥)))
51	50	ifbid 4502	. . . . . . 7 ⊢ (𝑚 = 𝑦 → if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅) = if(cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅))
52	46, 51	cbvmpov 7453	. . . . . 6 ⊢ (𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)) = (𝑥 ∈ 2o, 𝑦 ∈ ℕ0 ↦ if(cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅))
53		1oex 8407	. . . . . . 7 ⊢ 1o ∈ V
54	53, 16	ifex 4529	. . . . . 6 ⊢ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) ∈ V
55	41, 52, 54	ovmpoa 7513	. . . . 5 ⊢ (((𝐶‘𝑁) ∈ 2o ∧ 𝑁 ∈ ℕ0) → ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))𝑁) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
56	34, 1, 55	syl2anc 585	. . . 4 ⊢ (𝜑 → ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))𝑁) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
57	10, 30, 56	3eqtrd 2774	. . 3 ⊢ (𝜑 → (𝐶‘(𝑁 + 1)) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
58	57	eleq2d 2821	. 2 ⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ ∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅)))
59		noel 4289	. . . . 5 ⊢ ¬ ∅ ∈ ∅
60		iffalse 4487	. . . . . 6 ⊢ (¬ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) = ∅)
61	60	eleq2d 2821	. . . . 5 ⊢ (¬ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → (∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) ↔ ∅ ∈ ∅))
62	59, 61	mtbiri 327	. . . 4 ⊢ (¬ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → ¬ ∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
63	62	con4i 114	. . 3 ⊢ (∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) → cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)))
64		0lt1o 8431	. . . 4 ⊢ ∅ ∈ 1o
65		iftrue 4484	. . . 4 ⊢ (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) = 1o)
66	64, 65	eleqtrrid 2842	. . 3 ⊢ (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → ∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
67	63, 66	impbii 209	. 2 ⊢ (∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)))
68	58, 67	bitrdi 287	1 ⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542  caddwcad 1608   ∈ wcel 2114   ≠ wne 2931   ⊆ wss 3900  ∅c0 4284  ifcif 4478   ↦ cmpt 5178  ‘cfv 6491  (class class class)co 7358   ∈ cmpo 7360  1_oc1o 8390  2_oc2o 8391  0cc0 11028  1c1 11029   + caddc 11031   − cmin 11366  ℕcn 12147  ℕ₀cn0 12403  ℤ_≥cuz 12753  seqcseq 13926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-icn 11087  ax-addcl 11088  ax-addrcl 11089  ax-mulcl 11090  ax-mulrcl 11091  ax-mulcom 11092  ax-addass 11093  ax-mulass 11094  ax-distr 11095  ax-i2m1 11096  ax-1ne0 11097  ax-1rid 11098  ax-rnegex 11099  ax-rrecex 11100  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103  ax-pre-ltadd 11104  ax-pre-mulgt0 11105

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-xor 1514  df-tru 1545  df-fal 1555  df-cad 1609  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-nel 3036  df-ral 3051  df-rex 3060  df-reu 3350  df-rab 3399  df-v 3441  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-iun 4947  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6258  df-ord 6319  df-on 6320  df-lim 6321  df-suc 6322  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-f1 6496  df-fo 6497  df-f1o 6498  df-fv 6499  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-1o 8397  df-2o 8398  df-er 8635  df-en 8886  df-dom 8887  df-sdom 8888  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-sub 11368  df-neg 11369  df-nn 12148  df-n0 12404  df-z 12491  df-uz 12754  df-fz 13426  df-seq 13927

This theorem is referenced by:  sadcaddlem  16386  sadadd2lem  16388  saddisjlem  16393