![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > naddel1 | Structured version Visualization version GIF version |
Description: Ordinal less-than is not affected by natural addition. (Contributed by Scott Fenton, 9-Sep-2024.) |
Ref | Expression |
---|---|
naddel1 | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ (𝐴 +no 𝐶) ∈ (𝐵 +no 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | naddelim 8711 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 → (𝐴 +no 𝐶) ∈ (𝐵 +no 𝐶))) | |
2 | naddssim 8710 | . . . 4 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ⊆ 𝐴 → (𝐵 +no 𝐶) ⊆ (𝐴 +no 𝐶))) | |
3 | 2 | 3com12 1120 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ⊆ 𝐴 → (𝐵 +no 𝐶) ⊆ (𝐴 +no 𝐶))) |
4 | ontri1 6406 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) | |
5 | 4 | ancoms 457 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) |
6 | 5 | 3adant3 1129 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ 𝐵)) |
7 | naddcl 8702 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 +no 𝐶) ∈ On) | |
8 | 7 | 3adant1 1127 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 +no 𝐶) ∈ On) |
9 | naddcl 8702 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐴 +no 𝐶) ∈ On) | |
10 | ontri1 6406 | . . . 4 ⊢ (((𝐵 +no 𝐶) ∈ On ∧ (𝐴 +no 𝐶) ∈ On) → ((𝐵 +no 𝐶) ⊆ (𝐴 +no 𝐶) ↔ ¬ (𝐴 +no 𝐶) ∈ (𝐵 +no 𝐶))) | |
11 | 8, 9, 10 | 3imp3i2an 1342 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐵 +no 𝐶) ⊆ (𝐴 +no 𝐶) ↔ ¬ (𝐴 +no 𝐶) ∈ (𝐵 +no 𝐶))) |
12 | 3, 6, 11 | 3imtr3d 292 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ 𝐴 ∈ 𝐵 → ¬ (𝐴 +no 𝐶) ∈ (𝐵 +no 𝐶))) |
13 | 1, 12 | impcon4bid 226 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 ∈ 𝐵 ↔ (𝐴 +no 𝐶) ∈ (𝐵 +no 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ w3a 1084 ∈ wcel 2098 ⊆ wss 3947 Oncon0 6372 (class class class)co 7424 +no cnadd 8690 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2698 ax-rep 5287 ax-sep 5301 ax-nul 5308 ax-pow 5367 ax-pr 5431 ax-un 7744 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2937 df-ral 3058 df-rex 3067 df-reu 3373 df-rab 3429 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4325 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4911 df-int 4952 df-iun 5000 df-br 5151 df-opab 5213 df-mpt 5234 df-tr 5268 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5635 df-se 5636 df-we 5637 df-xp 5686 df-rel 5687 df-cnv 5688 df-co 5689 df-dm 5690 df-rn 5691 df-res 5692 df-ima 5693 df-pred 6308 df-ord 6375 df-on 6376 df-suc 6378 df-iota 6503 df-fun 6553 df-fn 6554 df-f 6555 df-f1 6556 df-fo 6557 df-f1o 6558 df-fv 6559 df-ov 7427 df-oprab 7428 df-mpo 7429 df-1st 7997 df-2nd 7998 df-frecs 8291 df-nadd 8691 |
This theorem is referenced by: naddel2 8713 naddss1 8714 naddel12 8725 addsproplem2 27905 mulsproplem2 28035 mulsproplem5 28038 mulsproplem6 28039 mulsproplem7 28040 mulsproplem8 28041 |
Copyright terms: Public domain | W3C validator |