Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nadd2rabtr Structured version   Visualization version   GIF version

Theorem nadd2rabtr 43374
Description: The set of ordinals which have a natural sum less than some ordinal is transitive. (Contributed by RP, 20-Dec-2024.)
Assertion
Ref Expression
nadd2rabtr ((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) → Tr {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem nadd2rabtr
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 simpll1 1211 . . . . . . 7 ((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → Ord 𝐴)
2 simplr 769 . . . . . . 7 ((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → 𝑦𝐴)
3 ordelss 6402 . . . . . . 7 ((Ord 𝐴𝑦𝐴) → 𝑦𝐴)
41, 2, 3syl2anc 584 . . . . . 6 ((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → 𝑦𝐴)
5 simpll3 1213 . . . . . . . 8 ((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → 𝐶 ∈ On)
65adantr 480 . . . . . . 7 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → 𝐶 ∈ On)
7 simpr 484 . . . . . . . . 9 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → 𝑥𝑦)
81adantr 480 . . . . . . . . . . . 12 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → Ord 𝐴)
9 simpllr 776 . . . . . . . . . . . 12 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → 𝑦𝐴)
10 ordelon 6410 . . . . . . . . . . . 12 ((Ord 𝐴𝑦𝐴) → 𝑦 ∈ On)
118, 9, 10syl2anc 584 . . . . . . . . . . 11 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → 𝑦 ∈ On)
12 onelon 6411 . . . . . . . . . . 11 ((𝑦 ∈ On ∧ 𝑥𝑦) → 𝑥 ∈ On)
1311, 7, 12syl2anc 584 . . . . . . . . . 10 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → 𝑥 ∈ On)
14 simpll2 1212 . . . . . . . . . . 11 ((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → 𝐵 ∈ On)
1514adantr 480 . . . . . . . . . 10 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → 𝐵 ∈ On)
16 naddel2 8725 . . . . . . . . . 10 ((𝑥 ∈ On ∧ 𝑦 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝑦 ↔ (𝐵 +no 𝑥) ∈ (𝐵 +no 𝑦)))
1713, 11, 15, 16syl3anc 1370 . . . . . . . . 9 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → (𝑥𝑦 ↔ (𝐵 +no 𝑥) ∈ (𝐵 +no 𝑦)))
187, 17mpbid 232 . . . . . . . 8 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → (𝐵 +no 𝑥) ∈ (𝐵 +no 𝑦))
19 simplr 769 . . . . . . . 8 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → (𝐵 +no 𝑦) ∈ 𝐶)
2018, 19jca 511 . . . . . . 7 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → ((𝐵 +no 𝑥) ∈ (𝐵 +no 𝑦) ∧ (𝐵 +no 𝑦) ∈ 𝐶))
21 ontr1 6432 . . . . . . 7 (𝐶 ∈ On → (((𝐵 +no 𝑥) ∈ (𝐵 +no 𝑦) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → (𝐵 +no 𝑥) ∈ 𝐶))
226, 20, 21sylc 65 . . . . . 6 (((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) ∧ 𝑥𝑦) → (𝐵 +no 𝑥) ∈ 𝐶)
234, 22ssrabdv 4084 . . . . 5 ((((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) ∧ (𝐵 +no 𝑦) ∈ 𝐶) → 𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶})
2423ex 412 . . . 4 (((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) ∧ 𝑦𝐴) → ((𝐵 +no 𝑦) ∈ 𝐶𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}))
2524ralrimiva 3144 . . 3 ((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) → ∀𝑦𝐴 ((𝐵 +no 𝑦) ∈ 𝐶𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}))
26 oveq2 7439 . . . . 5 (𝑥 = 𝑦 → (𝐵 +no 𝑥) = (𝐵 +no 𝑦))
2726eleq1d 2824 . . . 4 (𝑥 = 𝑦 → ((𝐵 +no 𝑥) ∈ 𝐶 ↔ (𝐵 +no 𝑦) ∈ 𝐶))
2827ralrab 3702 . . 3 (∀𝑦 ∈ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶} ↔ ∀𝑦𝐴 ((𝐵 +no 𝑦) ∈ 𝐶𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}))
2925, 28sylibr 234 . 2 ((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) → ∀𝑦 ∈ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶})
30 dftr3 5271 . 2 (Tr {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶} ↔ ∀𝑦 ∈ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶}𝑦 ⊆ {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶})
3129, 30sylibr 234 1 ((Ord 𝐴𝐵 ∈ On ∧ 𝐶 ∈ On) → Tr {𝑥𝐴 ∣ (𝐵 +no 𝑥) ∈ 𝐶})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086  wcel 2106  wral 3059  {crab 3433  wss 3963  Tr wtr 5265  Ord word 6385  Oncon0 6386  (class class class)co 7431   +no cnadd 8702
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-1st 8013  df-2nd 8014  df-frecs 8305  df-nadd 8703
This theorem is referenced by:  nadd2rabord  43375  nadd1rabtr  43378
  Copyright terms: Public domain W3C validator