| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nadd4 | Structured version Visualization version GIF version | ||
| Description: Rearragement of terms in a quadruple sum. (Contributed by Scott Fenton, 5-Feb-2025.) |
| Ref | Expression |
|---|---|
| nadd4 | ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 +no 𝐵) +no (𝐶 +no 𝐷)) = ((𝐴 +no 𝐶) +no (𝐵 +no 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nadd32 8683 | . . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 +no 𝐵) +no 𝐶) = ((𝐴 +no 𝐶) +no 𝐵)) | |
| 2 | 1 | 3expa 1134 | . . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ On) → ((𝐴 +no 𝐵) +no 𝐶) = ((𝐴 +no 𝐶) +no 𝐵)) |
| 3 | 2 | adantrr 729 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 +no 𝐵) +no 𝐶) = ((𝐴 +no 𝐶) +no 𝐵)) |
| 4 | 3 | oveq1d 7426 | . 2 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (((𝐴 +no 𝐵) +no 𝐶) +no 𝐷) = (((𝐴 +no 𝐶) +no 𝐵) +no 𝐷)) |
| 5 | naddcl 8662 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +no 𝐵) ∈ On) | |
| 6 | 5 | adantr 485 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 +no 𝐵) ∈ On) |
| 7 | simprl 782 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐶 ∈ On) | |
| 8 | simprr 784 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐷 ∈ On) | |
| 9 | naddass 8682 | . . 3 ⊢ (((𝐴 +no 𝐵) ∈ On ∧ 𝐶 ∈ On ∧ 𝐷 ∈ On) → (((𝐴 +no 𝐵) +no 𝐶) +no 𝐷) = ((𝐴 +no 𝐵) +no (𝐶 +no 𝐷))) | |
| 10 | 6, 7, 8, 9 | syl3anc 1396 | . 2 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (((𝐴 +no 𝐵) +no 𝐶) +no 𝐷) = ((𝐴 +no 𝐵) +no (𝐶 +no 𝐷))) |
| 11 | naddcl 8662 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐴 +no 𝐶) ∈ On) | |
| 12 | 11 | ad2ant2r 759 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 +no 𝐶) ∈ On) |
| 13 | simplr 780 | . . 3 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐵 ∈ On) | |
| 14 | naddass 8682 | . . 3 ⊢ (((𝐴 +no 𝐶) ∈ On ∧ 𝐵 ∈ On ∧ 𝐷 ∈ On) → (((𝐴 +no 𝐶) +no 𝐵) +no 𝐷) = ((𝐴 +no 𝐶) +no (𝐵 +no 𝐷))) | |
| 15 | 12, 13, 8, 14 | syl3anc 1396 | . 2 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (((𝐴 +no 𝐶) +no 𝐵) +no 𝐷) = ((𝐴 +no 𝐶) +no (𝐵 +no 𝐷))) |
| 16 | 4, 10, 15 | 3eqtr3d 2812 | 1 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 +no 𝐵) +no (𝐶 +no 𝐷)) = ((𝐴 +no 𝐶) +no (𝐵 +no 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 Oncon0 6361 (class class class)co 7411 +no cnadd 8650 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-ot 4603 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7985 df-2nd 7986 df-frecs 8277 df-nadd 8651 |
| This theorem is referenced by: nadd42 8685 |
| Copyright terms: Public domain | W3C validator |