MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  naddss1 Structured version   Visualization version   GIF version

Theorem naddss1 8625
Description: Ordinal less-than-or-equal is not affected by natural addition. (Contributed by Scott Fenton, 9-Sep-2024.)
Assertion
Ref Expression
naddss1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 ↔ (𝐴 +no 𝐶) ⊆ (𝐵 +no 𝐶)))

Proof of Theorem naddss1
StepHypRef Expression
1 naddel1 8623 . . . 4 ((𝐵 ∈ On ∧ 𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐵𝐴 ↔ (𝐵 +no 𝐶) ∈ (𝐴 +no 𝐶)))
213com12 1124 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵𝐴 ↔ (𝐵 +no 𝐶) ∈ (𝐴 +no 𝐶)))
32notbid 318 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (¬ 𝐵𝐴 ↔ ¬ (𝐵 +no 𝐶) ∈ (𝐴 +no 𝐶)))
4 ontri1 6357 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
543adant3 1133 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
6 naddcl 8613 . . . 4 ((𝐴 ∈ On ∧ 𝐶 ∈ On) → (𝐴 +no 𝐶) ∈ On)
763adant2 1132 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴 +no 𝐶) ∈ On)
8 naddcl 8613 . . . 4 ((𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 +no 𝐶) ∈ On)
983adant1 1131 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐵 +no 𝐶) ∈ On)
10 ontri1 6357 . . 3 (((𝐴 +no 𝐶) ∈ On ∧ (𝐵 +no 𝐶) ∈ On) → ((𝐴 +no 𝐶) ⊆ (𝐵 +no 𝐶) ↔ ¬ (𝐵 +no 𝐶) ∈ (𝐴 +no 𝐶)))
117, 9, 10syl2anc 585 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → ((𝐴 +no 𝐶) ⊆ (𝐵 +no 𝐶) ↔ ¬ (𝐵 +no 𝐶) ∈ (𝐴 +no 𝐶)))
123, 5, 113bitr4d 311 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ On) → (𝐴𝐵 ↔ (𝐴 +no 𝐶) ⊆ (𝐵 +no 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  w3a 1087  wcel 2114  wss 3889  Oncon0 6323  (class class class)co 7367   +no cnadd 8601
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 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-frecs 8231  df-nadd 8602
This theorem is referenced by:  naddss2  8626  naddunif  8629  mulsproplem13  28120
  Copyright terms: Public domain W3C validator