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

Theorem fin23lem24 10217
Description: Lemma for fin23 10284. In a class of ordinals, each element is fully identified by those of its predecessors which also belong to the class. (Contributed by Stefan O'Rear, 1-Nov-2014.)
Assertion
Ref Expression
fin23lem24 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → ((𝐶𝐵) = (𝐷𝐵) ↔ 𝐶 = 𝐷))

Proof of Theorem fin23lem24
StepHypRef Expression
1 simpll 766 . . . . . 6 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → Ord 𝐴)
2 simplr 768 . . . . . . 7 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → 𝐵𝐴)
3 simprl 770 . . . . . . 7 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → 𝐶𝐵)
42, 3sseldd 3944 . . . . . 6 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → 𝐶𝐴)
5 ordelord 6338 . . . . . 6 ((Ord 𝐴𝐶𝐴) → Ord 𝐶)
61, 4, 5syl2anc 585 . . . . 5 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → Ord 𝐶)
7 simprr 772 . . . . . . 7 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → 𝐷𝐵)
82, 7sseldd 3944 . . . . . 6 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → 𝐷𝐴)
9 ordelord 6338 . . . . . 6 ((Ord 𝐴𝐷𝐴) → Ord 𝐷)
101, 8, 9syl2anc 585 . . . . 5 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → Ord 𝐷)
11 ordtri3 6352 . . . . . 6 ((Ord 𝐶 ∧ Ord 𝐷) → (𝐶 = 𝐷 ↔ ¬ (𝐶𝐷𝐷𝐶)))
1211necon2abid 2985 . . . . 5 ((Ord 𝐶 ∧ Ord 𝐷) → ((𝐶𝐷𝐷𝐶) ↔ 𝐶𝐷))
136, 10, 12syl2anc 585 . . . 4 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → ((𝐶𝐷𝐷𝐶) ↔ 𝐶𝐷))
14 simpr 486 . . . . . . . . 9 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → 𝐶𝐷)
15 simplrl 776 . . . . . . . . 9 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → 𝐶𝐵)
1614, 15elind 4153 . . . . . . . 8 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → 𝐶 ∈ (𝐷𝐵))
176adantr 482 . . . . . . . . . 10 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → Ord 𝐶)
18 ordirr 6334 . . . . . . . . . 10 (Ord 𝐶 → ¬ 𝐶𝐶)
1917, 18syl 17 . . . . . . . . 9 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → ¬ 𝐶𝐶)
20 elinel1 4154 . . . . . . . . 9 (𝐶 ∈ (𝐶𝐵) → 𝐶𝐶)
2119, 20nsyl 140 . . . . . . . 8 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → ¬ 𝐶 ∈ (𝐶𝐵))
22 nelne1 3040 . . . . . . . 8 ((𝐶 ∈ (𝐷𝐵) ∧ ¬ 𝐶 ∈ (𝐶𝐵)) → (𝐷𝐵) ≠ (𝐶𝐵))
2316, 21, 22syl2anc 585 . . . . . . 7 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → (𝐷𝐵) ≠ (𝐶𝐵))
2423necomd 2998 . . . . . 6 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐶𝐷) → (𝐶𝐵) ≠ (𝐷𝐵))
25 simpr 486 . . . . . . . 8 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → 𝐷𝐶)
26 simplrr 777 . . . . . . . 8 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → 𝐷𝐵)
2725, 26elind 4153 . . . . . . 7 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → 𝐷 ∈ (𝐶𝐵))
2810adantr 482 . . . . . . . . 9 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → Ord 𝐷)
29 ordirr 6334 . . . . . . . . 9 (Ord 𝐷 → ¬ 𝐷𝐷)
3028, 29syl 17 . . . . . . . 8 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → ¬ 𝐷𝐷)
31 elinel1 4154 . . . . . . . 8 (𝐷 ∈ (𝐷𝐵) → 𝐷𝐷)
3230, 31nsyl 140 . . . . . . 7 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → ¬ 𝐷 ∈ (𝐷𝐵))
33 nelne1 3040 . . . . . . 7 ((𝐷 ∈ (𝐶𝐵) ∧ ¬ 𝐷 ∈ (𝐷𝐵)) → (𝐶𝐵) ≠ (𝐷𝐵))
3427, 32, 33syl2anc 585 . . . . . 6 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ 𝐷𝐶) → (𝐶𝐵) ≠ (𝐷𝐵))
3524, 34jaodan 957 . . . . 5 ((((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) ∧ (𝐶𝐷𝐷𝐶)) → (𝐶𝐵) ≠ (𝐷𝐵))
3635ex 414 . . . 4 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → ((𝐶𝐷𝐷𝐶) → (𝐶𝐵) ≠ (𝐷𝐵)))
3713, 36sylbird 260 . . 3 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → (𝐶𝐷 → (𝐶𝐵) ≠ (𝐷𝐵)))
3837necon4d 2966 . 2 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → ((𝐶𝐵) = (𝐷𝐵) → 𝐶 = 𝐷))
39 ineq1 4164 . 2 (𝐶 = 𝐷 → (𝐶𝐵) = (𝐷𝐵))
4038, 39impbid1 224 1 (((Ord 𝐴𝐵𝐴) ∧ (𝐶𝐵𝐷𝐵)) → ((𝐶𝐵) = (𝐷𝐵) ↔ 𝐶 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 397  wo 846   = wceq 1542  wcel 2107  wne 2942  cin 3908  wss 3909  Ord word 6315
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2709  ax-sep 5255  ax-nul 5262  ax-pr 5383
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2943  df-ral 3064  df-rex 3073  df-rab 3407  df-v 3446  df-dif 3912  df-un 3914  df-in 3916  df-ss 3926  df-pss 3928  df-nul 4282  df-if 4486  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4865  df-br 5105  df-opab 5167  df-tr 5222  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5587  df-we 5589  df-ord 6319
This theorem is referenced by:  fin23lem23  10221
  Copyright terms: Public domain W3C validator