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 9219
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 9216 through tz9.12lem3 9218. (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 2821 . . . 4 (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) = (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)})
31, 2tz9.12lem2 9217 . . 3 suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On
43onsuci 7553 . 2 suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On
51, 2tz9.12lem3 9218 . 2 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴)))
6 fveq2 6670 . . . 4 (𝑦 = suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) → (𝑅1𝑦) = (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴)))
76eleq2d 2898 . . 3 (𝑦 = suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) → (𝐴 ∈ (𝑅1𝑦) ↔ 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴))))
87rspcev 3623 . 2 ((suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On ∧ 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴))) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
94, 5, 8sylancr 589 1 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  wral 3138  wrex 3139  {crab 3142  Vcvv 3494   cuni 4838   cint 4876  cmpt 5146  cima 5558  Oncon0 6191  suc csuc 6193  cfv 6355  𝑅1cr1 9191
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-om 7581  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-r1 9193
This theorem is referenced by:  tz9.13  9220  r1elss  9235
  Copyright terms: Public domain W3C validator