Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  naddid1 Structured version   Visualization version   GIF version

Theorem naddid1 33763
Description: Ordinal zero is the additive identity for natural addition. (Contributed by Scott Fenton, 26-Aug-2024.)
Assertion
Ref Expression
naddid1 (𝐴 ∈ On → (𝐴 +no ∅) = 𝐴)

Proof of Theorem naddid1
Dummy variables 𝑎 𝑏 𝑐 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq1 7262 . . 3 (𝑎 = 𝑏 → (𝑎 +no ∅) = (𝑏 +no ∅))
2 id 22 . . 3 (𝑎 = 𝑏𝑎 = 𝑏)
31, 2eqeq12d 2754 . 2 (𝑎 = 𝑏 → ((𝑎 +no ∅) = 𝑎 ↔ (𝑏 +no ∅) = 𝑏))
4 oveq1 7262 . . 3 (𝑎 = 𝐴 → (𝑎 +no ∅) = (𝐴 +no ∅))
5 id 22 . . 3 (𝑎 = 𝐴𝑎 = 𝐴)
64, 5eqeq12d 2754 . 2 (𝑎 = 𝐴 → ((𝑎 +no ∅) = 𝑎 ↔ (𝐴 +no ∅) = 𝐴))
7 0elon 6304 . . . . . 6 ∅ ∈ On
8 naddov2 33761 . . . . . 6 ((𝑎 ∈ On ∧ ∅ ∈ On) → (𝑎 +no ∅) = {𝑥 ∈ On ∣ (∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥)})
97, 8mpan2 687 . . . . 5 (𝑎 ∈ On → (𝑎 +no ∅) = {𝑥 ∈ On ∣ (∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥)})
109adantr 480 . . . 4 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → (𝑎 +no ∅) = {𝑥 ∈ On ∣ (∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥)})
11 ral0 4440 . . . . . . . 8 𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥
1211biantrur 530 . . . . . . 7 (∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥 ↔ (∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥))
13 eleq1 2826 . . . . . . . . . . 11 ((𝑏 +no ∅) = 𝑏 → ((𝑏 +no ∅) ∈ 𝑥𝑏𝑥))
1413ralimi 3086 . . . . . . . . . 10 (∀𝑏𝑎 (𝑏 +no ∅) = 𝑏 → ∀𝑏𝑎 ((𝑏 +no ∅) ∈ 𝑥𝑏𝑥))
15 ralbi 3092 . . . . . . . . . 10 (∀𝑏𝑎 ((𝑏 +no ∅) ∈ 𝑥𝑏𝑥) → (∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥 ↔ ∀𝑏𝑎 𝑏𝑥))
1614, 15syl 17 . . . . . . . . 9 (∀𝑏𝑎 (𝑏 +no ∅) = 𝑏 → (∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥 ↔ ∀𝑏𝑎 𝑏𝑥))
1716adantl 481 . . . . . . . 8 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → (∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥 ↔ ∀𝑏𝑎 𝑏𝑥))
18 dfss3 3905 . . . . . . . 8 (𝑎𝑥 ↔ ∀𝑏𝑎 𝑏𝑥)
1917, 18bitr4di 288 . . . . . . 7 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → (∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥𝑎𝑥))
2012, 19bitr3id 284 . . . . . 6 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → ((∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥) ↔ 𝑎𝑥))
2120rabbidv 3404 . . . . 5 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → {𝑥 ∈ On ∣ (∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥)} = {𝑥 ∈ On ∣ 𝑎𝑥})
2221inteqd 4881 . . . 4 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → {𝑥 ∈ On ∣ (∀𝑐 ∈ ∅ (𝑎 +no 𝑐) ∈ 𝑥 ∧ ∀𝑏𝑎 (𝑏 +no ∅) ∈ 𝑥)} = {𝑥 ∈ On ∣ 𝑎𝑥})
23 intmin 4896 . . . . 5 (𝑎 ∈ On → {𝑥 ∈ On ∣ 𝑎𝑥} = 𝑎)
2423adantr 480 . . . 4 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → {𝑥 ∈ On ∣ 𝑎𝑥} = 𝑎)
2510, 22, 243eqtrd 2782 . . 3 ((𝑎 ∈ On ∧ ∀𝑏𝑎 (𝑏 +no ∅) = 𝑏) → (𝑎 +no ∅) = 𝑎)
2625ex 412 . 2 (𝑎 ∈ On → (∀𝑏𝑎 (𝑏 +no ∅) = 𝑏 → (𝑎 +no ∅) = 𝑎))
273, 6, 26tfis3 7679 1 (𝐴 ∈ On → (𝐴 +no ∅) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wral 3063  {crab 3067  wss 3883  c0 4253   cint 4876  Oncon0 6251  (class class class)co 7255   +no cnadd 33751
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-1st 7804  df-2nd 7805  df-frecs 8068  df-nadd 33752
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator