ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  onunsnss GIF version

Theorem onunsnss 7224
Description: Adding a singleton to create an ordinal. (Contributed by Jim Kingdon, 20-Oct-2021.)
Assertion
Ref Expression
onunsnss ((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) → 𝐵 ⊆ 𝐴)

Proof of Theorem onunsnss
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elirr 4688 . . . . 5 ¬ 𝐵 ∈ 𝐵
2 elsni 3727 . . . . . . . 8 (𝑥 ∈ {𝐵} → 𝑥 = 𝐵)
32adantl 277 . . . . . . 7 ((((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∈ {𝐵}) → 𝑥 = 𝐵)
4 simplr 533 . . . . . . 7 ((((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∈ {𝐵}) → 𝑥 ∈ 𝐵)
53, 4eqeltrrd 2316 . . . . . 6 ((((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) ∧ 𝑥 ∈ {𝐵}) → 𝐵 ∈ 𝐵)
65ex 115 . . . . 5 (((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ {𝐵} → 𝐵 ∈ 𝐵))
71, 6mtoi 674 . . . 4 (((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) → ¬ 𝑥 ∈ {𝐵})
8 snidg 3738 . . . . . . . . 9 (𝐵 ∈ 𝑉 → 𝐵 ∈ {𝐵})
9 elun2 3397 . . . . . . . . 9 (𝐵 ∈ {𝐵} → 𝐵 ∈ (𝐴 ∪ {𝐵}))
108, 9syl 14 . . . . . . . 8 (𝐵 ∈ 𝑉 → 𝐵 ∈ (𝐴 ∪ {𝐵}))
1110adantr 276 . . . . . . 7 ((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) → 𝐵 ∈ (𝐴 ∪ {𝐵}))
12 ontr1 4534 . . . . . . . 8 ((𝐴 ∪ {𝐵}) ∈ On → ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ (𝐴 ∪ {𝐵})) → 𝑥 ∈ (𝐴 ∪ {𝐵})))
1312adantl 277 . . . . . . 7 ((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) → ((𝑥 ∈ 𝐵 ∧ 𝐵 ∈ (𝐴 ∪ {𝐵})) → 𝑥 ∈ (𝐴 ∪ {𝐵})))
1411, 13mpan2d 432 . . . . . 6 ((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) → (𝑥 ∈ 𝐵 → 𝑥 ∈ (𝐴 ∪ {𝐵})))
1514imp 124 . . . . 5 (((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝐴 ∪ {𝐵}))
16 elun 3370 . . . . 5 (𝑥 ∈ (𝐴 ∪ {𝐵}) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
1715, 16sylib 122 . . . 4 (((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) → (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ {𝐵}))
187, 17ecased 1390 . . 3 (((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐴)
1918ex 115 . 2 ((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝐴))
2019ssrdv 3254 1 ((𝐵 ∈ 𝑉 ∧ (𝐴 ∪ {𝐵}) ∈ On) → 𝐵 ⊆ 𝐴)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720   = wceq 1402   ∈ wcel 2209   ∪ cun 3218   ⊆ wss 3220  {csn 3709  Oncon0 4508
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-uni 3936  df-tr 4230  df-iord 4511  df-on 4513
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator