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

Theorem ordsucuniel 7824
Description: Given an element 𝐴 of the union of an ordinal 𝐵, suc 𝐴 is an element of 𝐵 itself. (Contributed by Scott Fenton, 28-Mar-2012.) (Proof shortened by Mario Carneiro, 29-May-2015.)
Assertion
Ref Expression
ordsucuniel (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))

Proof of Theorem ordsucuniel
StepHypRef Expression
1 orduni 7792 . . 3 (Ord 𝐵 → Ord ∪ 𝐵)
2 ordelord 6377 . . . 4 ((Ord ∪ 𝐵 ∧ 𝐴 ∈ ∪ 𝐵) → Ord 𝐴)
32ex 418 . . 3 (Ord ∪ 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴))
41, 3syl 18 . 2 (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴))
5 ordelord 6377 . . . 4 ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord suc 𝐴)
6 ordsuc 7814 . . . 4 (Ord 𝐴 ↔ Ord suc 𝐴)
75, 6sylibr 237 . . 3 ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord 𝐴)
87ex 418 . 2 (Ord 𝐵 → (suc 𝐴 ∈ 𝐵 → Ord 𝐴))
9 ordsson 7786 . . . . . 6 (Ord 𝐵 → 𝐵 ⊆ On)
10 ordunisssuc 6464 . . . . . 6 ((𝐵 ⊆ On ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴))
119, 10sylan 592 . . . . 5 ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴))
12 ordtri1 6389 . . . . . 6 ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵))
131, 12sylan 592 . . . . 5 ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵))
14 ordtri1 6389 . . . . . 6 ((Ord 𝐵 ∧ Ord suc 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵))
156, 14sylan2b 606 . . . . 5 ((Ord 𝐵 ∧ Ord 𝐴) → (𝐵 ⊆ suc 𝐴 ↔ ¬ suc 𝐴 ∈ 𝐵))
1611, 13, 153bitr3d 312 . . . 4 ((Ord 𝐵 ∧ Ord 𝐴) → (¬ 𝐴 ∈ ∪ 𝐵 ↔ ¬ suc 𝐴 ∈ 𝐵))
1716con4bid 320 . . 3 ((Ord 𝐵 ∧ Ord 𝐴) → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))
1817ex 418 . 2 (Ord 𝐵 → (Ord 𝐴 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵)))
194, 8, 18pm5.21ndd 382 1 (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 ↔ suc 𝐴 ∈ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145   ⊆ wss 3899  ∪ cuni 4867  Ord word 6354  Oncon0 6355  suc csuc 6357
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6358  df-on 6359  df-suc 6361
This theorem is used by:  naddsuc2  8695  dfac12lem1  10203  dfac12lem2  10204
  Copyright terms: Public domain W3C validator