Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dford3lem2 Structured version   Visualization version   GIF version

Theorem dford3lem2 44299
Description: Lemma for dford3 44300. (Contributed by Stefan O'Rear, 28-Oct-2014.)
Assertion
Ref Expression
dford3lem2 ((Tr 𝑥 ∧ ∀𝑦 ∈ 𝑥 Tr 𝑦) → 𝑥 ∈ On)
Distinct variable group:   𝑥,𝑦

Proof of Theorem dford3lem2
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 suctr 6476 . . . 4 (Tr 𝑥 → Tr suc 𝑥)
2 vex 3457 . . . . 5 𝑥 ∈ V
32sucid 6472 . . . 4 𝑥 ∈ suc 𝑥
42sucex 7853 . . . . 5 suc 𝑥 ∈ V
5 treq 5224 . . . . . 6 (𝑐 = suc 𝑥 → (Tr 𝑐 ↔ Tr suc 𝑥))
6 eleq2 2856 . . . . . 6 (𝑐 = suc 𝑥 → (𝑥 ∈ 𝑐 ↔ 𝑥 ∈ suc 𝑥))
75, 6anbi12d 644 . . . . 5 (𝑐 = suc 𝑥 → ((Tr 𝑐 ∧ 𝑥 ∈ 𝑐) ↔ (Tr suc 𝑥 ∧ 𝑥 ∈ suc 𝑥)))
84, 7spcev 3563 . . . 4 ((Tr suc 𝑥 ∧ 𝑥 ∈ suc 𝑥) → ∃𝑐(Tr 𝑐 ∧ 𝑥 ∈ 𝑐))
91, 3, 8sylancl 598 . . 3 (Tr 𝑥 → ∃𝑐(Tr 𝑐 ∧ 𝑥 ∈ 𝑐))
109adantr 486 . 2 ((Tr 𝑥 ∧ ∀𝑦 ∈ 𝑥 Tr 𝑦) → ∃𝑐(Tr 𝑐 ∧ 𝑥 ∈ 𝑐))
11 simprl 783 . . . . . 6 ((∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) ∧ (Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦)) → Tr 𝑎)
12 dford3lem1 44298 . . . . . . . . 9 ((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) → ∀𝑏 ∈ 𝑎 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦))
13 ralim 3109 . . . . . . . . 9 (∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) → (∀𝑏 ∈ 𝑎 (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → ∀𝑏 ∈ 𝑎 𝑏 ∈ On))
1412, 13syl5 35 . . . . . . . 8 (∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) → ((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) → ∀𝑏 ∈ 𝑎 𝑏 ∈ On))
1514imp 412 . . . . . . 7 ((∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) ∧ (Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦)) → ∀𝑏 ∈ 𝑎 𝑏 ∈ On)
16 dfss3 3901 . . . . . . 7 (𝑎 ⊆ On ↔ ∀𝑏 ∈ 𝑎 𝑏 ∈ On)
1715, 16sylibr 237 . . . . . 6 ((∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) ∧ (Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦)) → 𝑎 ⊆ On)
18 ordon 7822 . . . . . . 7 Ord On
1918a1i 11 . . . . . 6 ((∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) ∧ (Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦)) → Ord On)
20 trssord 6404 . . . . . 6 ((Tr 𝑎 ∧ 𝑎 ⊆ On ∧ Ord On) → Ord 𝑎)
2111, 17, 19, 20syl3anc 1401 . . . . 5 ((∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) ∧ (Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦)) → Ord 𝑎)
22 vex 3457 . . . . . 6 𝑎 ∈ V
2322elon 6396 . . . . 5 (𝑎 ∈ On ↔ Ord 𝑎)
2421, 23sylibr 237 . . . 4 ((∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) ∧ (Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦)) → 𝑎 ∈ On)
2524ex 418 . . 3 (∀𝑏 ∈ 𝑎 ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On) → ((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) → 𝑎 ∈ On))
26 treq 5224 . . . . 5 (𝑎 = 𝑏 → (Tr 𝑎 ↔ Tr 𝑏))
27 raleq 3320 . . . . 5 (𝑎 = 𝑏 → (∀𝑦 ∈ 𝑎 Tr 𝑦 ↔ ∀𝑦 ∈ 𝑏 Tr 𝑦))
2826, 27anbi12d 644 . . . 4 (𝑎 = 𝑏 → ((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) ↔ (Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦)))
29 eleq1w 2850 . . . 4 (𝑎 = 𝑏 → (𝑎 ∈ On ↔ 𝑏 ∈ On))
3028, 29imbi12d 347 . . 3 (𝑎 = 𝑏 → (((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) → 𝑎 ∈ On) ↔ ((Tr 𝑏 ∧ ∀𝑦 ∈ 𝑏 Tr 𝑦) → 𝑏 ∈ On)))
31 treq 5224 . . . . 5 (𝑎 = 𝑥 → (Tr 𝑎 ↔ Tr 𝑥))
32 raleq 3320 . . . . 5 (𝑎 = 𝑥 → (∀𝑦 ∈ 𝑎 Tr 𝑦 ↔ ∀𝑦 ∈ 𝑥 Tr 𝑦))
3331, 32anbi12d 644 . . . 4 (𝑎 = 𝑥 → ((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) ↔ (Tr 𝑥 ∧ ∀𝑦 ∈ 𝑥 Tr 𝑦)))
34 eleq1w 2850 . . . 4 (𝑎 = 𝑥 → (𝑎 ∈ On ↔ 𝑥 ∈ On))
3533, 34imbi12d 347 . . 3 (𝑎 = 𝑥 → (((Tr 𝑎 ∧ ∀𝑦 ∈ 𝑎 Tr 𝑦) → 𝑎 ∈ On) ↔ ((Tr 𝑥 ∧ ∀𝑦 ∈ 𝑥 Tr 𝑦) → 𝑥 ∈ On)))
3625, 30, 35setindtrs 44297 . 2 (∃𝑐(Tr 𝑐 ∧ 𝑥 ∈ 𝑐) → ((Tr 𝑥 ∧ ∀𝑦 ∈ 𝑥 Tr 𝑦) → 𝑥 ∈ On))
3710, 36mpcom 39 1 ((Tr 𝑥 ∧ ∀𝑦 ∈ 𝑥 Tr 𝑦) → 𝑥 ∈ On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150  ∀wral 3083   ⊆ wss 3899  Tr wtr 5217  Ord word 6386  Oncon0 6387  suc csuc 6389
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-pr 5397  ax-un 7782  ax-reg 9622
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-tr 5218  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-ord 6390  df-on 6391  df-suc 6393
This theorem is used by:  dford3  44300
  Copyright terms: Public domain W3C validator