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

Theorem ordsucun 7845
Description: The successor of the maximum (i.e. union) of two ordinals is the maximum of their successors. (Contributed by NM, 28-Nov-2003.)
Assertion
Ref Expression
ordsucun ((Ord 𝐴 ∧ Ord 𝐵) → suc (𝐴𝐵) = (suc 𝐴 ∪ suc 𝐵))

Proof of Theorem ordsucun
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ordun 6490 . . . 4 ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴𝐵))
2 ordsuc 7833 . . . . 5 (Ord (𝐴𝐵) ↔ Ord suc (𝐴𝐵))
3 ordelon 6410 . . . . . 6 ((Ord suc (𝐴𝐵) ∧ 𝑥 ∈ suc (𝐴𝐵)) → 𝑥 ∈ On)
43ex 412 . . . . 5 (Ord suc (𝐴𝐵) → (𝑥 ∈ suc (𝐴𝐵) → 𝑥 ∈ On))
52, 4sylbi 217 . . . 4 (Ord (𝐴𝐵) → (𝑥 ∈ suc (𝐴𝐵) → 𝑥 ∈ On))
61, 5syl 17 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ suc (𝐴𝐵) → 𝑥 ∈ On))
7 ordsuc 7833 . . . 4 (Ord 𝐴 ↔ Ord suc 𝐴)
8 ordsuc 7833 . . . 4 (Ord 𝐵 ↔ Ord suc 𝐵)
9 ordun 6490 . . . . 5 ((Ord suc 𝐴 ∧ Ord suc 𝐵) → Ord (suc 𝐴 ∪ suc 𝐵))
10 ordelon 6410 . . . . . 6 ((Ord (suc 𝐴 ∪ suc 𝐵) ∧ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵)) → 𝑥 ∈ On)
1110ex 412 . . . . 5 (Ord (suc 𝐴 ∪ suc 𝐵) → (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) → 𝑥 ∈ On))
129, 11syl 17 . . . 4 ((Ord suc 𝐴 ∧ Ord suc 𝐵) → (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) → 𝑥 ∈ On))
137, 8, 12syl2anb 598 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) → 𝑥 ∈ On))
14 ordssun 6488 . . . . . . 7 ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ⊆ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵)))
1514adantl 481 . . . . . 6 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ⊆ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵)))
16 ordsssuc 6475 . . . . . . 7 ((𝑥 ∈ On ∧ Ord (𝐴𝐵)) → (𝑥 ⊆ (𝐴𝐵) ↔ 𝑥 ∈ suc (𝐴𝐵)))
171, 16sylan2 593 . . . . . 6 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ⊆ (𝐴𝐵) ↔ 𝑥 ∈ suc (𝐴𝐵)))
18 ordsssuc 6475 . . . . . . . 8 ((𝑥 ∈ On ∧ Ord 𝐴) → (𝑥𝐴𝑥 ∈ suc 𝐴))
1918adantrr 717 . . . . . . 7 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥𝐴𝑥 ∈ suc 𝐴))
20 ordsssuc 6475 . . . . . . . 8 ((𝑥 ∈ On ∧ Ord 𝐵) → (𝑥𝐵𝑥 ∈ suc 𝐵))
2120adantrl 716 . . . . . . 7 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥𝐵𝑥 ∈ suc 𝐵))
2219, 21orbi12d 918 . . . . . 6 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → ((𝑥𝐴𝑥𝐵) ↔ (𝑥 ∈ suc 𝐴𝑥 ∈ suc 𝐵)))
2315, 17, 223bitr3d 309 . . . . 5 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ∈ suc (𝐴𝐵) ↔ (𝑥 ∈ suc 𝐴𝑥 ∈ suc 𝐵)))
24 elun 4163 . . . . 5 (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) ↔ (𝑥 ∈ suc 𝐴𝑥 ∈ suc 𝐵))
2523, 24bitr4di 289 . . . 4 ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ∈ suc (𝐴𝐵) ↔ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵)))
2625expcom 413 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ On → (𝑥 ∈ suc (𝐴𝐵) ↔ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵))))
276, 13, 26pm5.21ndd 379 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ suc (𝐴𝐵) ↔ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵)))
2827eqrdv 2733 1 ((Ord 𝐴 ∧ Ord 𝐵) → suc (𝐴𝐵) = (suc 𝐴 ∪ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  wo 847   = wceq 1537  wcel 2106  cun 3961  wss 3963  Ord word 6385  Oncon0 6386  suc csuc 6388
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-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
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-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  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-br 5149  df-opab 5211  df-tr 5266  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-ord 6389  df-on 6390  df-suc 6392
This theorem is referenced by:  rankprb  9889
  Copyright terms: Public domain W3C validator