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

Theorem rankwflemb 9729
Description: Two ways of saying a set is well-founded. (Contributed by NM, 11-Oct-2003.) (Revised by Mario Carneiro, 16-Nov-2014.)
Assertion
Ref Expression
rankwflemb (𝐴 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
Distinct variable group:   𝑥,𝐴

Proof of Theorem rankwflemb
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eluni 4868 . . 3 (𝐴 (𝑅1 “ On) ↔ ∃𝑦(𝐴𝑦𝑦 ∈ (𝑅1 “ On)))
2 eleq2 2826 . . . . . . . 8 ((𝑅1𝑥) = 𝑦 → (𝐴 ∈ (𝑅1𝑥) ↔ 𝐴𝑦))
32biimprcd 249 . . . . . . 7 (𝐴𝑦 → ((𝑅1𝑥) = 𝑦𝐴 ∈ (𝑅1𝑥)))
4 r1tr 9712 . . . . . . . . . . 11 Tr (𝑅1𝑥)
5 trss 5233 . . . . . . . . . . 11 (Tr (𝑅1𝑥) → (𝐴 ∈ (𝑅1𝑥) → 𝐴 ⊆ (𝑅1𝑥)))
64, 5ax-mp 5 . . . . . . . . . 10 (𝐴 ∈ (𝑅1𝑥) → 𝐴 ⊆ (𝑅1𝑥))
7 elpwg 4563 . . . . . . . . . 10 (𝐴 ∈ (𝑅1𝑥) → (𝐴 ∈ 𝒫 (𝑅1𝑥) ↔ 𝐴 ⊆ (𝑅1𝑥)))
86, 7mpbird 256 . . . . . . . . 9 (𝐴 ∈ (𝑅1𝑥) → 𝐴 ∈ 𝒫 (𝑅1𝑥))
9 elfvdm 6879 . . . . . . . . . 10 (𝐴 ∈ (𝑅1𝑥) → 𝑥 ∈ dom 𝑅1)
10 r1sucg 9705 . . . . . . . . . 10 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1𝑥))
119, 10syl 17 . . . . . . . . 9 (𝐴 ∈ (𝑅1𝑥) → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1𝑥))
128, 11eleqtrrd 2841 . . . . . . . 8 (𝐴 ∈ (𝑅1𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥))
1312a1i 11 . . . . . . 7 (𝑥 ∈ On → (𝐴 ∈ (𝑅1𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥)))
143, 13syl9 77 . . . . . 6 (𝐴𝑦 → (𝑥 ∈ On → ((𝑅1𝑥) = 𝑦𝐴 ∈ (𝑅1‘suc 𝑥))))
1514reximdvai 3162 . . . . 5 (𝐴𝑦 → (∃𝑥 ∈ On (𝑅1𝑥) = 𝑦 → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)))
16 r1funlim 9702 . . . . . . 7 (Fun 𝑅1 ∧ Lim dom 𝑅1)
1716simpli 484 . . . . . 6 Fun 𝑅1
18 fvelima 6908 . . . . . 6 ((Fun 𝑅1𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On (𝑅1𝑥) = 𝑦)
1917, 18mpan 688 . . . . 5 (𝑦 ∈ (𝑅1 “ On) → ∃𝑥 ∈ On (𝑅1𝑥) = 𝑦)
2015, 19impel 506 . . . 4 ((𝐴𝑦𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
2120exlimiv 1933 . . 3 (∃𝑦(𝐴𝑦𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
221, 21sylbi 216 . 2 (𝐴 (𝑅1 “ On) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
23 elfvdm 6879 . . . . . 6 (𝐴 ∈ (𝑅1‘suc 𝑥) → suc 𝑥 ∈ dom 𝑅1)
24 fvelrn 7027 . . . . . 6 ((Fun 𝑅1 ∧ suc 𝑥 ∈ dom 𝑅1) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
2517, 23, 24sylancr 587 . . . . 5 (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
26 df-ima 5646 . . . . . 6 (𝑅1 “ On) = ran (𝑅1 ↾ On)
27 funrel 6518 . . . . . . . . 9 (Fun 𝑅1 → Rel 𝑅1)
2817, 27ax-mp 5 . . . . . . . 8 Rel 𝑅1
2916simpri 486 . . . . . . . . 9 Lim dom 𝑅1
30 limord 6377 . . . . . . . . 9 (Lim dom 𝑅1 → Ord dom 𝑅1)
31 ordsson 7717 . . . . . . . . 9 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
3229, 30, 31mp2b 10 . . . . . . . 8 dom 𝑅1 ⊆ On
33 relssres 5978 . . . . . . . 8 ((Rel 𝑅1 ∧ dom 𝑅1 ⊆ On) → (𝑅1 ↾ On) = 𝑅1)
3428, 32, 33mp2an 690 . . . . . . 7 (𝑅1 ↾ On) = 𝑅1
3534rneqi 5892 . . . . . 6 ran (𝑅1 ↾ On) = ran 𝑅1
3626, 35eqtri 2764 . . . . 5 (𝑅1 “ On) = ran 𝑅1
3725, 36eleqtrrdi 2849 . . . 4 (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On))
38 elunii 4870 . . . 4 ((𝐴 ∈ (𝑅1‘suc 𝑥) ∧ (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On)) → 𝐴 (𝑅1 “ On))
3937, 38mpdan 685 . . 3 (𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 (𝑅1 “ On))
4039rexlimivw 3148 . 2 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 (𝑅1 “ On))
4122, 40impbii 208 1 (𝐴 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106  wrex 3073  wss 3910  𝒫 cpw 4560   cuni 4865  Tr wtr 5222  dom cdm 5633  ran crn 5634  cres 5635  cima 5636  Rel wrel 5638  Ord word 6316  Oncon0 6317  Lim wlim 6318  suc csuc 6319  Fun wfun 6490  cfv 6496  𝑅1cr1 9698
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-om 7803  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-r1 9700
This theorem is referenced by:  rankf  9730  r1elwf  9732  rankvalb  9733  rankidb  9736  rankwflem  9751  tcrank  9820  dfac12r  10082
  Copyright terms: Public domain W3C validator