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

Theorem tz7.7 6099
Description: A transitive class belongs to an ordinal class iff it is strictly included in it. Proposition 7.7 of [TakeutiZaring] p. 37. (Contributed by NM, 5-May-1994.)
Assertion
Ref Expression
tz7.7 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 ↔ (𝐵𝐴𝐵𝐴)))

Proof of Theorem tz7.7
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ordtr 6087 . . . 4 (Ord 𝐴 → Tr 𝐴)
2 ordfr 6088 . . . 4 (Ord 𝐴 → E Fr 𝐴)
3 tz7.2 5434 . . . . 5 ((Tr 𝐴 ∧ E Fr 𝐴𝐵𝐴) → (𝐵𝐴𝐵𝐴))
433exp 1112 . . . 4 (Tr 𝐴 → ( E Fr 𝐴 → (𝐵𝐴 → (𝐵𝐴𝐵𝐴))))
51, 2, 4sylc 65 . . 3 (Ord 𝐴 → (𝐵𝐴 → (𝐵𝐴𝐵𝐴)))
65adantr 481 . 2 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → (𝐵𝐴𝐵𝐴)))
7 pssdifn0 4251 . . . . . 6 ((𝐵𝐴𝐵𝐴) → (𝐴𝐵) ≠ ∅)
8 difss 4035 . . . . . . . . . . . 12 (𝐴𝐵) ⊆ 𝐴
9 tz7.5 6094 . . . . . . . . . . . 12 ((Ord 𝐴 ∧ (𝐴𝐵) ⊆ 𝐴 ∧ (𝐴𝐵) ≠ ∅) → ∃𝑥 ∈ (𝐴𝐵)((𝐴𝐵) ∩ 𝑥) = ∅)
108, 9mp3an2 1441 . . . . . . . . . . 11 ((Ord 𝐴 ∧ (𝐴𝐵) ≠ ∅) → ∃𝑥 ∈ (𝐴𝐵)((𝐴𝐵) ∩ 𝑥) = ∅)
11 eldifi 4030 . . . . . . . . . . . . . . . . . 18 (𝑥 ∈ (𝐴𝐵) → 𝑥𝐴)
12 trss 5079 . . . . . . . . . . . . . . . . . 18 (Tr 𝐴 → (𝑥𝐴𝑥𝐴))
13 difin0ss 4254 . . . . . . . . . . . . . . . . . . 19 (((𝐴𝐵) ∩ 𝑥) = ∅ → (𝑥𝐴𝑥𝐵))
1413com12 32 . . . . . . . . . . . . . . . . . 18 (𝑥𝐴 → (((𝐴𝐵) ∩ 𝑥) = ∅ → 𝑥𝐵))
1511, 12, 14syl56 36 . . . . . . . . . . . . . . . . 17 (Tr 𝐴 → (𝑥 ∈ (𝐴𝐵) → (((𝐴𝐵) ∩ 𝑥) = ∅ → 𝑥𝐵)))
161, 15syl 17 . . . . . . . . . . . . . . . 16 (Ord 𝐴 → (𝑥 ∈ (𝐴𝐵) → (((𝐴𝐵) ∩ 𝑥) = ∅ → 𝑥𝐵)))
1716ad2antrr 722 . . . . . . . . . . . . . . 15 (((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) → (𝑥 ∈ (𝐴𝐵) → (((𝐴𝐵) ∩ 𝑥) = ∅ → 𝑥𝐵)))
1817imp32 419 . . . . . . . . . . . . . 14 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ (𝑥 ∈ (𝐴𝐵) ∧ ((𝐴𝐵) ∩ 𝑥) = ∅)) → 𝑥𝐵)
19 eleq1w 2867 . . . . . . . . . . . . . . . . . . . . . . . . 25 (𝑦 = 𝑥 → (𝑦𝐵𝑥𝐵))
2019biimpcd 250 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑦𝐵 → (𝑦 = 𝑥𝑥𝐵))
21 eldifn 4031 . . . . . . . . . . . . . . . . . . . . . . . 24 (𝑥 ∈ (𝐴𝐵) → ¬ 𝑥𝐵)
2220, 21nsyli 160 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑦𝐵 → (𝑥 ∈ (𝐴𝐵) → ¬ 𝑦 = 𝑥))
2322imp 407 . . . . . . . . . . . . . . . . . . . . . 22 ((𝑦𝐵𝑥 ∈ (𝐴𝐵)) → ¬ 𝑦 = 𝑥)
2423adantll 710 . . . . . . . . . . . . . . . . . . . . 21 (((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵)) → ¬ 𝑦 = 𝑥)
2524adantl 482 . . . . . . . . . . . . . . . . . . . 20 (((Ord 𝐴 ∧ Tr 𝐵) ∧ ((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵))) → ¬ 𝑦 = 𝑥)
26 trel 5077 . . . . . . . . . . . . . . . . . . . . . . . . . . 27 (Tr 𝐵 → ((𝑥𝑦𝑦𝐵) → 𝑥𝐵))
2726expcomd 417 . . . . . . . . . . . . . . . . . . . . . . . . . 26 (Tr 𝐵 → (𝑦𝐵 → (𝑥𝑦𝑥𝐵)))
2827imp 407 . . . . . . . . . . . . . . . . . . . . . . . . 25 ((Tr 𝐵𝑦𝐵) → (𝑥𝑦𝑥𝐵))
2928, 21nsyli 160 . . . . . . . . . . . . . . . . . . . . . . . 24 ((Tr 𝐵𝑦𝐵) → (𝑥 ∈ (𝐴𝐵) → ¬ 𝑥𝑦))
3029ex 413 . . . . . . . . . . . . . . . . . . . . . . 23 (Tr 𝐵 → (𝑦𝐵 → (𝑥 ∈ (𝐴𝐵) → ¬ 𝑥𝑦)))
3130adantld 491 . . . . . . . . . . . . . . . . . . . . . 22 (Tr 𝐵 → ((𝐵𝐴𝑦𝐵) → (𝑥 ∈ (𝐴𝐵) → ¬ 𝑥𝑦)))
3231imp32 419 . . . . . . . . . . . . . . . . . . . . 21 ((Tr 𝐵 ∧ ((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵))) → ¬ 𝑥𝑦)
3332adantll 710 . . . . . . . . . . . . . . . . . . . 20 (((Ord 𝐴 ∧ Tr 𝐵) ∧ ((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵))) → ¬ 𝑥𝑦)
34 ordwe 6086 . . . . . . . . . . . . . . . . . . . . . 22 (Ord 𝐴 → E We 𝐴)
35 ssel2 3890 . . . . . . . . . . . . . . . . . . . . . . 23 ((𝐵𝐴𝑦𝐵) → 𝑦𝐴)
3635, 11anim12i 612 . . . . . . . . . . . . . . . . . . . . . 22 (((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵)) → (𝑦𝐴𝑥𝐴))
37 wecmpep 5442 . . . . . . . . . . . . . . . . . . . . . 22 (( E We 𝐴 ∧ (𝑦𝐴𝑥𝐴)) → (𝑦𝑥𝑦 = 𝑥𝑥𝑦))
3834, 36, 37syl2an 595 . . . . . . . . . . . . . . . . . . . . 21 ((Ord 𝐴 ∧ ((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵))) → (𝑦𝑥𝑦 = 𝑥𝑥𝑦))
3938adantlr 711 . . . . . . . . . . . . . . . . . . . 20 (((Ord 𝐴 ∧ Tr 𝐵) ∧ ((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵))) → (𝑦𝑥𝑦 = 𝑥𝑥𝑦))
4025, 33, 39ecase23d 1465 . . . . . . . . . . . . . . . . . . 19 (((Ord 𝐴 ∧ Tr 𝐵) ∧ ((𝐵𝐴𝑦𝐵) ∧ 𝑥 ∈ (𝐴𝐵))) → 𝑦𝑥)
4140exp44 438 . . . . . . . . . . . . . . . . . 18 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → (𝑦𝐵 → (𝑥 ∈ (𝐴𝐵) → 𝑦𝑥))))
4241com34 91 . . . . . . . . . . . . . . . . 17 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → (𝑥 ∈ (𝐴𝐵) → (𝑦𝐵𝑦𝑥))))
4342imp31 418 . . . . . . . . . . . . . . . 16 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ 𝑥 ∈ (𝐴𝐵)) → (𝑦𝐵𝑦𝑥))
4443ssrdv 3901 . . . . . . . . . . . . . . 15 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ 𝑥 ∈ (𝐴𝐵)) → 𝐵𝑥)
4544adantrr 713 . . . . . . . . . . . . . 14 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ (𝑥 ∈ (𝐴𝐵) ∧ ((𝐴𝐵) ∩ 𝑥) = ∅)) → 𝐵𝑥)
4618, 45eqssd 3912 . . . . . . . . . . . . 13 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ (𝑥 ∈ (𝐴𝐵) ∧ ((𝐴𝐵) ∩ 𝑥) = ∅)) → 𝑥 = 𝐵)
4711ad2antrl 724 . . . . . . . . . . . . 13 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ (𝑥 ∈ (𝐴𝐵) ∧ ((𝐴𝐵) ∩ 𝑥) = ∅)) → 𝑥𝐴)
4846, 47eqeltrrd 2886 . . . . . . . . . . . 12 ((((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) ∧ (𝑥 ∈ (𝐴𝐵) ∧ ((𝐴𝐵) ∩ 𝑥) = ∅)) → 𝐵𝐴)
4948rexlimdvaa 3250 . . . . . . . . . . 11 (((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) → (∃𝑥 ∈ (𝐴𝐵)((𝐴𝐵) ∩ 𝑥) = ∅ → 𝐵𝐴))
5010, 49syl5 34 . . . . . . . . . 10 (((Ord 𝐴 ∧ Tr 𝐵) ∧ 𝐵𝐴) → ((Ord 𝐴 ∧ (𝐴𝐵) ≠ ∅) → 𝐵𝐴))
5150exp4b 431 . . . . . . . . 9 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → (Ord 𝐴 → ((𝐴𝐵) ≠ ∅ → 𝐵𝐴))))
5251com23 86 . . . . . . . 8 ((Ord 𝐴 ∧ Tr 𝐵) → (Ord 𝐴 → (𝐵𝐴 → ((𝐴𝐵) ≠ ∅ → 𝐵𝐴))))
5352adantrd 492 . . . . . . 7 ((Ord 𝐴 ∧ Tr 𝐵) → ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → ((𝐴𝐵) ≠ ∅ → 𝐵𝐴))))
5453pm2.43i 52 . . . . . 6 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → ((𝐴𝐵) ≠ ∅ → 𝐵𝐴)))
557, 54syl7 74 . . . . 5 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → ((𝐵𝐴𝐵𝐴) → 𝐵𝐴)))
5655exp4a 432 . . . 4 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → (𝐵𝐴 → (𝐵𝐴𝐵𝐴))))
5756pm2.43d 53 . . 3 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 → (𝐵𝐴𝐵𝐴)))
5857impd 411 . 2 ((Ord 𝐴 ∧ Tr 𝐵) → ((𝐵𝐴𝐵𝐴) → 𝐵𝐴))
596, 58impbid 213 1 ((Ord 𝐴 ∧ Tr 𝐵) → (𝐵𝐴 ↔ (𝐵𝐴𝐵𝐴)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  w3o 1079   = wceq 1525  wcel 2083  wne 2986  wrex 3108  cdif 3862  cin 3864  wss 3865  c0 4217  Tr wtr 5070   E cep 5359   Fr wfr 5406   We wwe 5408  Ord word 6072
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1781  ax-4 1795  ax-5 1892  ax-6 1951  ax-7 1996  ax-8 2085  ax-9 2093  ax-10 2114  ax-11 2128  ax-12 2143  ax-13 2346  ax-ext 2771  ax-sep 5101  ax-nul 5108  ax-pr 5228
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-3or 1081  df-3an 1082  df-tru 1528  df-ex 1766  df-nf 1770  df-sb 2045  df-mo 2578  df-eu 2614  df-clab 2778  df-cleq 2790  df-clel 2865  df-nfc 2937  df-ne 2987  df-ral 3112  df-rex 3113  df-rab 3116  df-v 3442  df-sbc 3712  df-dif 3868  df-un 3870  df-in 3872  df-ss 3880  df-nul 4218  df-if 4388  df-sn 4479  df-pr 4481  df-op 4485  df-uni 4752  df-br 4969  df-opab 5031  df-tr 5071  df-eprel 5360  df-po 5369  df-so 5370  df-fr 5409  df-we 5411  df-ord 6076
This theorem is referenced by:  ordelssne  6100  dfon2  32647
  Copyright terms: Public domain W3C validator