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 8653
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 8650 through tz9.12lem3 8652. (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 2622 . . . 4 (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) = (𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)})
31, 2tz9.12lem2 8651 . . 3 suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On
43onsuci 7038 . 2 suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On
51, 2tz9.12lem3 8652 . 2 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴)))
6 fveq2 6191 . . . 4 (𝑦 = suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) → (𝑅1𝑦) = (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴)))
76eleq2d 2687 . . 3 (𝑦 = suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) → (𝐴 ∈ (𝑅1𝑦) ↔ 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴))))
87rspcev 3309 . 2 ((suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴) ∈ On ∧ 𝐴 ∈ (𝑅1‘suc suc ((𝑧 ∈ V ↦ {𝑣 ∈ On ∣ 𝑧 ∈ (𝑅1𝑣)}) “ 𝐴))) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
94, 5, 8sylancr 695 1 (∀𝑥𝐴𝑦 ∈ On 𝑥 ∈ (𝑅1𝑦) → ∃𝑦 ∈ On 𝐴 ∈ (𝑅1𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1483  wcel 1990  wral 2912  wrex 2913  {crab 2916  Vcvv 3200   cuni 4436   cint 4475  cmpt 4729  cima 5117  Oncon0 5723  suc csuc 5725  cfv 5888  𝑅1cr1 8625
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-r1 8627
This theorem is referenced by:  tz9.13  8654  r1elss  8669
  Copyright terms: Public domain W3C validator