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

Theorem ordsucuniel 7862
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 7830 . . 3 (Ord 𝐵 → Ord ∪ 𝐵)
2 ordelord 6405 . . . 4 ((Ord ∪ 𝐵 ∧ 𝐴 ∈ ∪ 𝐵) → Ord 𝐴)
32ex 418 . . 3 (Ord ∪ 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴))
41, 3syl 18 . 2 (Ord 𝐵 → (𝐴 ∈ ∪ 𝐵 → Ord 𝐴))
5 ordelord 6405 . . . 4 ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord suc 𝐴)
6 ordsuc 7852 . . . 4 (Ord 𝐴 ↔ Ord suc 𝐴)
75, 6sylibr 237 . . 3 ((Ord 𝐵 ∧ suc 𝐴 ∈ 𝐵) → Ord 𝐴)
87ex 418 . 2 (Ord 𝐵 → (suc 𝐴 ∈ 𝐵 → Ord 𝐴))
9 ordsson 7824 . . . . . 6 (Ord 𝐵 → 𝐵 ⊆ On)
10 ordunisssuc 6492 . . . . . 6 ((𝐵 ⊆ On ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴))
119, 10sylan 592 . . . . 5 ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ 𝐵 ⊆ suc 𝐴))
12 ordtri1 6417 . . . . . 6 ((Ord ∪ 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵))
131, 12sylan 592 . . . . 5 ((Ord 𝐵 ∧ Ord 𝐴) → (∪ 𝐵 ⊆ 𝐴 ↔ ¬ 𝐴 ∈ ∪ 𝐵))
14 ordtri1 6417 . . . . . 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 2147   ⊆ wss 3900  ∪ cuni 4870  Ord word 6382  Oncon0 6383  suc csuc 6385
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253  ax-pr 5396
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-tr 5217  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-ord 6386  df-on 6387  df-suc 6389
This theorem is used by:  naddsuc2  8742  dfac12lem1  10252  dfac12lem2  10253
  Copyright terms: Public domain W3C validator