Theorem sadcp1 16651

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 13027	. . . . . . 7 ⊢ ℕ0 = (ℤ≥‘0)
3	1, 2	eleqtrdi 2874	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ≥‘0))
4		seqp1 14183	. . . . . 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 18	. . . . 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 6906	. . . . 5 ⊢ (𝐶‘(𝑁 + 1)) = (seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘(𝑁 + 1))
8	6	fveq1i 6906	. . . . . 6 ⊢ (𝐶‘𝑁) = (seq0((𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)), (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))))‘𝑁)
9	8	oveq1i 7450	. . . . 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 2823	. . . 4 ⊢ (𝜑 → (𝐶‘(𝑁 + 1)) = ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1))))
11		peano2nn0 12670	. . . . . . 7 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0)
12		eqeq1 2767	. . . . . . . . 9 ⊢ (𝑛 = (𝑁 + 1) → (𝑛 = 0 ↔ (𝑁 + 1) = 0))
13		oveq1 7447	. . . . . . . . 9 ⊢ (𝑛 = (𝑁 + 1) → (𝑛 − 1) = ((𝑁 + 1) − 1))
14	12, 13	ifbieq2d 4512	. . . . . . . 8 ⊢ (𝑛 = (𝑁 + 1) → if(𝑛 = 0, ∅, (𝑛 − 1)) = if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)))
15		eqid 2763	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1))) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))
16		0ex 5264	. . . . . . . . 9 ⊢ ∅ ∈ V
17		ovex 7473	. . . . . . . . 9 ⊢ ((𝑁 + 1) − 1) ∈ V
18	16, 17	ifex 4536	. . . . . . . 8 ⊢ if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)) ∈ V
19	14, 15, 18	fvmpt 7013	. . . . . . 7 ⊢ ((𝑁 + 1) ∈ ℕ0 → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)) = if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)))
20	1, 11, 19	3syl 19	. . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)) = if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)))
21		nn0p1nn 12669	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ)
22	1, 21	syl 18	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
23	22	nnne0d 12412	. . . . . . 7 ⊢ (𝜑 → (𝑁 + 1) ≠ 0)
24		ifnefalse 4497	. . . . . . 7 ⊢ ((𝑁 + 1) ≠ 0 → if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)) = ((𝑁 + 1) − 1))
25	23, 24	syl 18	. . . . . 6 ⊢ (𝜑 → if((𝑁 + 1) = 0, ∅, ((𝑁 + 1) − 1)) = ((𝑁 + 1) − 1))
26	1	nn0cnd 12693	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ ℂ)
27		1cnd 11326	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
28	26, 27	pncand 11694	. . . . . 6 ⊢ (𝜑 → ((𝑁 + 1) − 1) = 𝑁)
29	20, 25, 28	3eqtrd 2802	. . . . 5 ⊢ (𝜑 → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, ∅, (𝑛 − 1)))‘(𝑁 + 1)) = 𝑁)
30	29	oveq2d 7456	. . . 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 16649	. . . . . 6 ⊢ (𝜑 → 𝐶:ℕ0⟶2o)
34	33, 1	ffvelcdmd 7106	. . . . 5 ⊢ (𝜑 → (𝐶‘𝑁) ∈ 2o)
35		simpr 490	. . . . . . . . 9 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → 𝑦 = 𝑁)
36	35	eleq1d 2849	. . . . . . . 8 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (𝑦 ∈ 𝐴 ↔ 𝑁 ∈ 𝐴))
37	35	eleq1d 2849	. . . . . . . 8 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (𝑦 ∈ 𝐵 ↔ 𝑁 ∈ 𝐵))
38		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → 𝑥 = (𝐶‘𝑁))
39	38	eleq2d 2850	. . . . . . . 8 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (∅ ∈ 𝑥 ↔ ∅ ∈ (𝐶‘𝑁)))
40	36, 37, 39	cadbi123d 1643	. . . . . . 7 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → (cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁))))
41	40	ifbid 4509	. . . . . 6 ⊢ ((𝑥 = (𝐶‘𝑁) ∧ 𝑦 = 𝑁) → if(cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
42		biidd 265	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (𝑚 ∈ 𝐴 ↔ 𝑚 ∈ 𝐴))
43		biidd 265	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (𝑚 ∈ 𝐵 ↔ 𝑚 ∈ 𝐵))
44		eleq2w 2848	. . . . . . . . 9 ⊢ (𝑐 = 𝑥 → (∅ ∈ 𝑐 ↔ ∅ ∈ 𝑥))
45	42, 43, 44	cadbi123d 1643	. . . . . . . 8 ⊢ (𝑐 = 𝑥 → (cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐) ↔ cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥)))
46	45	ifbid 4509	. . . . . . 7 ⊢ (𝑐 = 𝑥 → if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅) = if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅))
47		eleq1w 2847	. . . . . . . . 9 ⊢ (𝑚 = 𝑦 → (𝑚 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
48		eleq1w 2847	. . . . . . . . 9 ⊢ (𝑚 = 𝑦 → (𝑚 ∈ 𝐵 ↔ 𝑦 ∈ 𝐵))
49		biidd 265	. . . . . . . . 9 ⊢ (𝑚 = 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝑥))
50	47, 48, 49	cadbi123d 1643	. . . . . . . 8 ⊢ (𝑚 = 𝑦 → (cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥) ↔ cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥)))
51	50	ifbid 4509	. . . . . . 7 ⊢ (𝑚 = 𝑦 → if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅) = if(cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅))
52	46, 51	cbvmpov 7535	. . . . . 6 ⊢ (𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅)) = (𝑥 ∈ 2o, 𝑦 ∈ ℕ0 ↦ if(cadd(𝑦 ∈ 𝐴, 𝑦 ∈ 𝐵, ∅ ∈ 𝑥), 1o, ∅))
53		1oex 8511	. . . . . . 7 ⊢ 1o ∈ V
54	53, 16	ifex 4536	. . . . . 6 ⊢ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) ∈ V
55	41, 52, 54	ovmpoa 7596	. . . . 5 ⊢ (((𝐶‘𝑁) ∈ 2o ∧ 𝑁 ∈ ℕ0) → ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))𝑁) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
56	34, 1, 55	syl2anc 596	. . . 4 ⊢ (𝜑 → ((𝐶‘𝑁)(𝑐 ∈ 2o, 𝑚 ∈ ℕ0 ↦ if(cadd(𝑚 ∈ 𝐴, 𝑚 ∈ 𝐵, ∅ ∈ 𝑐), 1o, ∅))𝑁) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
57	10, 30, 56	3eqtrd 2802	. . 3 ⊢ (𝜑 → (𝐶‘(𝑁 + 1)) = if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
58	57	eleq2d 2850	. 2 ⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ ∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅)))
59		noel 4286	. . . . 5 ⊢ ¬ ∅ ∈ ∅
60		iffalse 4494	. . . . . 6 ⊢ (¬ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) = ∅)
61	60	eleq2d 2850	. . . . 5 ⊢ (¬ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → (∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) ↔ ∅ ∈ ∅))
62	59, 61	mtbiri 330	. . . 4 ⊢ (¬ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → ¬ ∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
63	62	con4i 115	. . 3 ⊢ (∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) → cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)))
64		0lt1o 8537	. . . 4 ⊢ ∅ ∈ 1o
65		iftrue 4491	. . . 4 ⊢ (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) = 1o)
66	64, 65	eleqtrrid 2871	. . 3 ⊢ (cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)) → ∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅))
67	63, 66	impbii 212	. 2 ⊢ (∅ ∈ if(cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)), 1o, ∅) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁)))
68	58, 67	bitrdi 290	1 ⊢ (𝜑 → (∅ ∈ (𝐶‘(𝑁 + 1)) ↔ cadd(𝑁 ∈ 𝐴, 𝑁 ∈ 𝐵, ∅ ∈ (𝐶‘𝑁))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  caddwcad 1639   ∈ wcel 2147   ≠ wne 2959   ⊆ wss 3900  ∅c0 4281  ifcif 4485   ↦ cmpt 5189  ‘cfv 6555  (class class class)co 7440   ∈ cmpo 7442  1_oc1o 8494  2_oc2o 8495  0cc0 11224  1c1 11225   + caddc 11227   − cmin 11565  ℕcn 12359  ℕ₀cn0 12630  ℤ_≥cuz 12989  seqcseq 14168

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-cnex 11280  ax-resscn 11281  ax-1cn 11282  ax-icn 11283  ax-addcl 11284  ax-addrcl 11285  ax-mulcl 11286  ax-mulrcl 11287  ax-mulcom 11288  ax-addass 11289  ax-mulass 11290  ax-distr 11291  ax-i2m1 11292  ax-1ne0 11293  ax-1rid 11294  ax-rnegex 11295  ax-rrecex 11296  ax-cnre 11297  ax-pre-lttri 11298  ax-pre-lttrn 11299  ax-pre-ltadd 11300  ax-pre-mulgt0 11301

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-xor 1542  df-tru 1573  df-fal 1583  df-cad 1640  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-om 7899  df-1st 8022  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-1o 8501  df-2o 8502  df-er 8742  df-en 8999  df-dom 9000  df-sdom 9001  df-pnf 11369  df-mnf 11370  df-xr 11371  df-ltxr 11372  df-le 11373  df-sub 11567  df-neg 11568  df-nn 12360  df-n0 12631  df-z 12718  df-uz 12990  df-fz 13664  df-seq 14169

This theorem is used by:  sadcaddlem  16653  sadadd2lem  16655  saddisjlem  16660