paddasslem17 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > paddasslem17		Structured version Visualization version GIF version

Theorem paddasslem17 37132

Description: Lemma for paddass 37134. The case when at least one sum argument is empty. (Contributed by NM, 12-Jan-2012.)

**Hypotheses**
Ref	Expression
paddass.a	⊢ 𝐴 = (Atoms‘𝐾)
paddass.p	⊢ + = (+_𝑃‘𝐾)

**Assertion**
Ref	Expression
paddasslem17	⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) ∧ ¬ ((𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∧ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅))) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍))

**Proof of Theorem paddasslem17**
Step	Hyp	Ref	Expression
1		ianor 979	. . . 4 ⊢ (¬ ((𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∧ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅)) ↔ (¬ (𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∨ ¬ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅)))
2		ianor 979	. . . . . 6 ⊢ (¬ (𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ↔ (¬ 𝑋 ≠ ∅ ∨ ¬ (𝑌 + 𝑍) ≠ ∅))
3		nne 2991	. . . . . . 7 ⊢ (¬ 𝑋 ≠ ∅ ↔ 𝑋 = ∅)
4		nne 2991	. . . . . . 7 ⊢ (¬ (𝑌 + 𝑍) ≠ ∅ ↔ (𝑌 + 𝑍) = ∅)
5	3, 4	orbi12i 912	. . . . . 6 ⊢ ((¬ 𝑋 ≠ ∅ ∨ ¬ (𝑌 + 𝑍) ≠ ∅) ↔ (𝑋 = ∅ ∨ (𝑌 + 𝑍) = ∅))
6	2, 5	bitri 278	. . . . 5 ⊢ (¬ (𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ↔ (𝑋 = ∅ ∨ (𝑌 + 𝑍) = ∅))
7		ianor 979	. . . . . 6 ⊢ (¬ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅) ↔ (¬ 𝑌 ≠ ∅ ∨ ¬ 𝑍 ≠ ∅))
8		nne 2991	. . . . . . 7 ⊢ (¬ 𝑌 ≠ ∅ ↔ 𝑌 = ∅)
9		nne 2991	. . . . . . 7 ⊢ (¬ 𝑍 ≠ ∅ ↔ 𝑍 = ∅)
10	8, 9	orbi12i 912	. . . . . 6 ⊢ ((¬ 𝑌 ≠ ∅ ∨ ¬ 𝑍 ≠ ∅) ↔ (𝑌 = ∅ ∨ 𝑍 = ∅))
11	7, 10	bitri 278	. . . . 5 ⊢ (¬ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅) ↔ (𝑌 = ∅ ∨ 𝑍 = ∅))
12	6, 11	orbi12i 912	. . . 4 ⊢ ((¬ (𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∨ ¬ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅)) ↔ ((𝑋 = ∅ ∨ (𝑌 + 𝑍) = ∅) ∨ (𝑌 = ∅ ∨ 𝑍 = ∅)))
13	1, 12	bitri 278	. . 3 ⊢ (¬ ((𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∧ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅)) ↔ ((𝑋 = ∅ ∨ (𝑌 + 𝑍) = ∅) ∨ (𝑌 = ∅ ∨ 𝑍 = ∅)))
14		paddass.a	. . . . . . . . . . 11 ⊢ 𝐴 = (Atoms‘𝐾)
15		paddass.p	. . . . . . . . . . 11 ⊢ + = (+_𝑃‘𝐾)
16	14, 15	paddssat 37110	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) → (𝑌 + 𝑍) ⊆ 𝐴)
17	16	3adant3r1 1179	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑌 + 𝑍) ⊆ 𝐴)
18	14, 15	padd02 37108	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑌 + 𝑍) ⊆ 𝐴) → (∅ + (𝑌 + 𝑍)) = (𝑌 + 𝑍))
19	17, 18	syldan 594	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (∅ + (𝑌 + 𝑍)) = (𝑌 + 𝑍))
20	14, 15	padd02 37108	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → (∅ + 𝑌) = 𝑌)
21	20	3ad2antr2 1186	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (∅ + 𝑌) = 𝑌)
22	21	oveq1d 7150	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((∅ + 𝑌) + 𝑍) = (𝑌 + 𝑍))
23	19, 22	eqtr4d 2836	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (∅ + (𝑌 + 𝑍)) = ((∅ + 𝑌) + 𝑍))
24		oveq1 7142	. . . . . . . 8 ⊢ (𝑋 = ∅ → (𝑋 + (𝑌 + 𝑍)) = (∅ + (𝑌 + 𝑍)))
25		oveq1 7142	. . . . . . . . 9 ⊢ (𝑋 = ∅ → (𝑋 + 𝑌) = (∅ + 𝑌))
26	25	oveq1d 7150	. . . . . . . 8 ⊢ (𝑋 = ∅ → ((𝑋 + 𝑌) + 𝑍) = ((∅ + 𝑌) + 𝑍))
27	24, 26	eqeq12d 2814	. . . . . . 7 ⊢ (𝑋 = ∅ → ((𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍) ↔ (∅ + (𝑌 + 𝑍)) = ((∅ + 𝑌) + 𝑍)))
28	23, 27	syl5ibrcom 250	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 = ∅ → (𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍)))
29		eqimss 3971	. . . . . 6 ⊢ ((𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍))
30	28, 29	syl6 35	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 = ∅ → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍)))
31	14, 15	padd01 37107	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴) → (𝑋 + ∅) = 𝑋)
32	31	3ad2antr1 1185	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + ∅) = 𝑋)
33	14, 15	sspadd1 37111	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → 𝑋 ⊆ (𝑋 + 𝑌))
34	33	3adant3r3 1181	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → 𝑋 ⊆ (𝑋 + 𝑌))
35		simpl 486	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → 𝐾 ∈ HL)
36	14, 15	paddssat 37110	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) ⊆ 𝐴)
37	36	3adant3r3 1181	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + 𝑌) ⊆ 𝐴)
38		simpr3 1193	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → 𝑍 ⊆ 𝐴)
39	14, 15	sspadd1 37111	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) → (𝑋 + 𝑌) ⊆ ((𝑋 + 𝑌) + 𝑍))
40	35, 37, 38, 39	syl3anc 1368	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + 𝑌) ⊆ ((𝑋 + 𝑌) + 𝑍))
41	34, 40	sstrd 3925	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → 𝑋 ⊆ ((𝑋 + 𝑌) + 𝑍))
42	32, 41	eqsstrd 3953	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + ∅) ⊆ ((𝑋 + 𝑌) + 𝑍))
43		oveq2 7143	. . . . . . 7 ⊢ ((𝑌 + 𝑍) = ∅ → (𝑋 + (𝑌 + 𝑍)) = (𝑋 + ∅))
44	43	sseq1d 3946	. . . . . 6 ⊢ ((𝑌 + 𝑍) = ∅ → ((𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍) ↔ (𝑋 + ∅) ⊆ ((𝑋 + 𝑌) + 𝑍)))
45	42, 44	syl5ibrcom 250	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑌 + 𝑍) = ∅ → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍)))
46	30, 45	jaod 856	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 = ∅ ∨ (𝑌 + 𝑍) = ∅) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍)))
47	14, 15	padd02 37108	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑍 ⊆ 𝐴) → (∅ + 𝑍) = 𝑍)
48	47	3ad2antr3 1187	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (∅ + 𝑍) = 𝑍)
49	48	oveq2d 7151	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + (∅ + 𝑍)) = (𝑋 + 𝑍))
50	32	oveq1d 7150	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 + ∅) + 𝑍) = (𝑋 + 𝑍))
51	49, 50	eqtr4d 2836	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + (∅ + 𝑍)) = ((𝑋 + ∅) + 𝑍))
52		oveq1 7142	. . . . . . . . 9 ⊢ (𝑌 = ∅ → (𝑌 + 𝑍) = (∅ + 𝑍))
53	52	oveq2d 7151	. . . . . . . 8 ⊢ (𝑌 = ∅ → (𝑋 + (𝑌 + 𝑍)) = (𝑋 + (∅ + 𝑍)))
54		oveq2 7143	. . . . . . . . 9 ⊢ (𝑌 = ∅ → (𝑋 + 𝑌) = (𝑋 + ∅))
55	54	oveq1d 7150	. . . . . . . 8 ⊢ (𝑌 = ∅ → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + ∅) + 𝑍))
56	53, 55	eqeq12d 2814	. . . . . . 7 ⊢ (𝑌 = ∅ → ((𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍) ↔ (𝑋 + (∅ + 𝑍)) = ((𝑋 + ∅) + 𝑍)))
57	51, 56	syl5ibrcom 250	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑌 = ∅ → (𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍)))
58	14, 15	padd01 37107	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑌 ⊆ 𝐴) → (𝑌 + ∅) = 𝑌)
59	58	3ad2antr2 1186	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑌 + ∅) = 𝑌)
60	59	oveq2d 7151	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + (𝑌 + ∅)) = (𝑋 + 𝑌))
61	14, 15	padd01 37107	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑋 + 𝑌) ⊆ 𝐴) → ((𝑋 + 𝑌) + ∅) = (𝑋 + 𝑌))
62	37, 61	syldan 594	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑋 + 𝑌) + ∅) = (𝑋 + 𝑌))
63	60, 62	eqtr4d 2836	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑋 + (𝑌 + ∅)) = ((𝑋 + 𝑌) + ∅))
64		oveq2 7143	. . . . . . . . 9 ⊢ (𝑍 = ∅ → (𝑌 + 𝑍) = (𝑌 + ∅))
65	64	oveq2d 7151	. . . . . . . 8 ⊢ (𝑍 = ∅ → (𝑋 + (𝑌 + 𝑍)) = (𝑋 + (𝑌 + ∅)))
66		oveq2 7143	. . . . . . . 8 ⊢ (𝑍 = ∅ → ((𝑋 + 𝑌) + 𝑍) = ((𝑋 + 𝑌) + ∅))
67	65, 66	eqeq12d 2814	. . . . . . 7 ⊢ (𝑍 = ∅ → ((𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍) ↔ (𝑋 + (𝑌 + ∅)) = ((𝑋 + 𝑌) + ∅)))
68	63, 67	syl5ibrcom 250	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (𝑍 = ∅ → (𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍)))
69	57, 68	jaod 856	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑌 = ∅ ∨ 𝑍 = ∅) → (𝑋 + (𝑌 + 𝑍)) = ((𝑋 + 𝑌) + 𝑍)))
70	69, 29	syl6 35	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → ((𝑌 = ∅ ∨ 𝑍 = ∅) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍)))
71	46, 70	jaod 856	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (((𝑋 = ∅ ∨ (𝑌 + 𝑍) = ∅) ∨ (𝑌 = ∅ ∨ 𝑍 = ∅)) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍)))
72	13, 71	syl5bi 245	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴)) → (¬ ((𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∧ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅)) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍)))
73	72	3impia 1114	1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴 ∧ 𝑍 ⊆ 𝐴) ∧ ¬ ((𝑋 ≠ ∅ ∧ (𝑌 + 𝑍) ≠ ∅) ∧ (𝑌 ≠ ∅ ∧ 𝑍 ≠ ∅))) → (𝑋 + (𝑌 + 𝑍)) ⊆ ((𝑋 + 𝑌) + 𝑍))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∨ wo 844 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ⊆ wss 3881 ∅c0 4243 ‘cfv 6324 (class class class)co 7135 Atomscatm 36559 HLchlt 36646 +_𝑃cpadd 37091

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-padd 37092

This theorem is referenced by: paddasslem18 37133

W3C validator