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

Theorem tz9.12 9775
Description: A set is well-founded if all of its elements are well-founded. Proposition 9.12 of [TakeutiZaring] p. 78. The main proof consists of tz9.12lem1 9772 through tz9.12lem3 9774. (Contributed by NM, 22-Sep-2003.)
Hypothesis
Ref Expression
tz9.12.1 𝐴 ∈ V
Assertion
Ref Expression
tz9.12 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem tz9.12
Dummy variables 𝑧 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tz9.12.1 . . . 4 𝐴 ∈ V
2 eqid 2762 . . . 4 (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) = (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)})
31, 2tz9.12lem2 9773 . . 3 suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On
43onsuci 7838 . 2 suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On
51, 2tz9.12lem3 9774 . 2 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴)))
6 fveq2 6882 . . . 4 (𝑦 = suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) → (𝑅1𝑦) = (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴)))
76eleq2d 2848 . . 3 (𝑦 = suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) → (𝐴 ∈ (𝑅1𝑦) ↔ 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴))))
87rspcev 3579 . 2 ((suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On ∧ 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴))) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
94, 5, 8sylancr 599 1 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  wral 3078  wrex 3088  {crab 3414  Vcvv 3453   cuni 4870   cint 4910  cmpt 5190  cima 5662  Oncon0 6361  suc csuc 6363  cfv 6537  𝑅1cr1 9747
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-om 7866  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-r1 9749
This theorem is used by:  tz9.13  9776  r1elss  9791  r1filimi  35598
  Copyright terms: Public domain W3C validator