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

Theorem phplem2OLD 9281
Description: Obsolete lemma for php 9273 as of 22-Nov-2024. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 16-Nov-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
phplem2OLD.1 𝐴 ∈ V
phplem2OLD.2 𝐵 ∈ V
Assertion
Ref Expression
phplem2OLD ((𝐴 ∈ ω ∧ 𝐵𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))

Proof of Theorem phplem2OLD
StepHypRef Expression
1 snex 5451 . . . . . 6 {⟨𝐵, 𝐴⟩} ∈ V
2 phplem2OLD.2 . . . . . . 7 𝐵 ∈ V
3 phplem2OLD.1 . . . . . . 7 𝐴 ∈ V
42, 3f1osn 6902 . . . . . 6 {⟨𝐵, 𝐴⟩}:{𝐵}–1-1-onto→{𝐴}
5 f1oen3g 9026 . . . . . 6 (({⟨𝐵, 𝐴⟩} ∈ V ∧ {⟨𝐵, 𝐴⟩}:{𝐵}–1-1-onto→{𝐴}) → {𝐵} ≈ {𝐴})
61, 4, 5mp2an 691 . . . . 5 {𝐵} ≈ {𝐴}
73difexi 5348 . . . . . 6 (𝐴 ∖ {𝐵}) ∈ V
87enref 9045 . . . . 5 (𝐴 ∖ {𝐵}) ≈ (𝐴 ∖ {𝐵})
96, 8pm3.2i 470 . . . 4 ({𝐵} ≈ {𝐴} ∧ (𝐴 ∖ {𝐵}) ≈ (𝐴 ∖ {𝐵}))
10 incom 4230 . . . . . 6 ({𝐴} ∩ (𝐴 ∖ {𝐵})) = ((𝐴 ∖ {𝐵}) ∩ {𝐴})
11 difss 4159 . . . . . . . . 9 (𝐴 ∖ {𝐵}) ⊆ 𝐴
12 ssrin 4263 . . . . . . . . 9 ((𝐴 ∖ {𝐵}) ⊆ 𝐴 → ((𝐴 ∖ {𝐵}) ∩ {𝐴}) ⊆ (𝐴 ∩ {𝐴}))
1311, 12ax-mp 5 . . . . . . . 8 ((𝐴 ∖ {𝐵}) ∩ {𝐴}) ⊆ (𝐴 ∩ {𝐴})
14 nnord 7911 . . . . . . . . 9 (𝐴 ∈ ω → Ord 𝐴)
15 orddisj 6433 . . . . . . . . 9 (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)
1614, 15syl 17 . . . . . . . 8 (𝐴 ∈ ω → (𝐴 ∩ {𝐴}) = ∅)
1713, 16sseqtrid 4061 . . . . . . 7 (𝐴 ∈ ω → ((𝐴 ∖ {𝐵}) ∩ {𝐴}) ⊆ ∅)
18 ss0 4425 . . . . . . 7 (((𝐴 ∖ {𝐵}) ∩ {𝐴}) ⊆ ∅ → ((𝐴 ∖ {𝐵}) ∩ {𝐴}) = ∅)
1917, 18syl 17 . . . . . 6 (𝐴 ∈ ω → ((𝐴 ∖ {𝐵}) ∩ {𝐴}) = ∅)
2010, 19eqtrid 2792 . . . . 5 (𝐴 ∈ ω → ({𝐴} ∩ (𝐴 ∖ {𝐵})) = ∅)
21 disjdif 4495 . . . . 5 ({𝐵} ∩ (𝐴 ∖ {𝐵})) = ∅
2220, 21jctil 519 . . . 4 (𝐴 ∈ ω → (({𝐵} ∩ (𝐴 ∖ {𝐵})) = ∅ ∧ ({𝐴} ∩ (𝐴 ∖ {𝐵})) = ∅))
23 unen 9112 . . . 4 ((({𝐵} ≈ {𝐴} ∧ (𝐴 ∖ {𝐵}) ≈ (𝐴 ∖ {𝐵})) ∧ (({𝐵} ∩ (𝐴 ∖ {𝐵})) = ∅ ∧ ({𝐴} ∩ (𝐴 ∖ {𝐵})) = ∅)) → ({𝐵} ∪ (𝐴 ∖ {𝐵})) ≈ ({𝐴} ∪ (𝐴 ∖ {𝐵})))
249, 22, 23sylancr 586 . . 3 (𝐴 ∈ ω → ({𝐵} ∪ (𝐴 ∖ {𝐵})) ≈ ({𝐴} ∪ (𝐴 ∖ {𝐵})))
2524adantr 480 . 2 ((𝐴 ∈ ω ∧ 𝐵𝐴) → ({𝐵} ∪ (𝐴 ∖ {𝐵})) ≈ ({𝐴} ∪ (𝐴 ∖ {𝐵})))
26 uncom 4181 . . . 4 ({𝐵} ∪ (𝐴 ∖ {𝐵})) = ((𝐴 ∖ {𝐵}) ∪ {𝐵})
27 difsnid 4835 . . . 4 (𝐵𝐴 → ((𝐴 ∖ {𝐵}) ∪ {𝐵}) = 𝐴)
2826, 27eqtrid 2792 . . 3 (𝐵𝐴 → ({𝐵} ∪ (𝐴 ∖ {𝐵})) = 𝐴)
2928adantl 481 . 2 ((𝐴 ∈ ω ∧ 𝐵𝐴) → ({𝐵} ∪ (𝐴 ∖ {𝐵})) = 𝐴)
30 phplem1OLD 9280 . 2 ((𝐴 ∈ ω ∧ 𝐵𝐴) → ({𝐴} ∪ (𝐴 ∖ {𝐵})) = (suc 𝐴 ∖ {𝐵}))
3125, 29, 303brtr3d 5197 1 ((𝐴 ∈ ω ∧ 𝐵𝐴) → 𝐴 ≈ (suc 𝐴 ∖ {𝐵}))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1537  wcel 2108  Vcvv 3488  cdif 3973  cun 3974  cin 3975  wss 3976  c0 4352  {csn 4648  cop 4654   class class class wbr 5166  Ord word 6394  suc csuc 6397  1-1-ontowf1o 6572  ωcom 7903  cen 9000
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-suc 6401  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-om 7904  df-en 9004
This theorem is referenced by:  phplem3OLD  9282
  Copyright terms: Public domain W3C validator