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

Theorem rankwflembOLD 9836
Description: Obsolete version of rankwflemb 9835 as of 29-Sep-2026. (Contributed by NM, 11-Oct-2003.) (Revised by Mario Carneiro, 16-Nov-2014.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rankwflembOLD (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
Distinct variable group:   𝑥,𝐴

Proof of Theorem rankwflembOLD
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eluni 4873 . . 3 (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)))
2 eleq2 2853 . . . . . . . 8 ((𝑅1‘𝑥) = 𝑦 → (𝐴 ∈ (𝑅1‘𝑥) ↔ 𝐴 ∈ 𝑦))
32biimprcd 253 . . . . . . 7 (𝐴 ∈ 𝑦 → ((𝑅1‘𝑥) = 𝑦 → 𝐴 ∈ (𝑅1‘𝑥)))
4 r1tr 9818 . . . . . . . . . . 11 Tr (𝑅1‘𝑥)
5 trss 5226 . . . . . . . . . . 11 (Tr (𝑅1‘𝑥) → (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ⊆ (𝑅1‘𝑥)))
64, 5ax-mp 5 . . . . . . . . . 10 (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ⊆ (𝑅1‘𝑥))
7 elpwg 4563 . . . . . . . . . 10 (𝐴 ∈ (𝑅1‘𝑥) → (𝐴 ∈ 𝒫 (𝑅1‘𝑥) ↔ 𝐴 ⊆ (𝑅1‘𝑥)))
86, 7mpbird 260 . . . . . . . . 9 (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ 𝒫 (𝑅1‘𝑥))
9 elfvdm 6948 . . . . . . . . . 10 (𝐴 ∈ (𝑅1‘𝑥) → 𝑥 ∈ dom 𝑅1)
10 r1sucg 9811 . . . . . . . . . 10 (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
119, 10syl 18 . . . . . . . . 9 (𝐴 ∈ (𝑅1‘𝑥) → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
128, 11eleqtrrd 2867 . . . . . . . 8 (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥))
1312a1i 11 . . . . . . 7 (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥)))
143, 13syl9 78 . . . . . 6 (𝐴 ∈ 𝑦 → (𝑥 ∈ On → ((𝑅1‘𝑥) = 𝑦 → 𝐴 ∈ (𝑅1‘suc 𝑥))))
1514reximdvai 3177 . . . . 5 (𝐴 ∈ 𝑦 → (∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦 → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)))
16 r1fun 9806 . . . . . 6 Fun 𝑅1
17 fvelima 6979 . . . . . 6 ((Fun 𝑅1 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦)
1816, 17mpan 703 . . . . 5 (𝑦 ∈ (𝑅1 “ On) → ∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦)
1915, 18impel 515 . . . 4 ((𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
2019exlimiv 1965 . . 3 (∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
211, 20sylbi 220 . 2 (𝐴 ∈ ∪ (𝑅1 “ On) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
22 elfvdm 6948 . . . . . 6 (𝐴 ∈ (𝑅1‘suc 𝑥) → suc 𝑥 ∈ dom 𝑅1)
23 fvelrn 7106 . . . . . 6 ((Fun 𝑅1 ∧ suc 𝑥 ∈ dom 𝑅1) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
2416, 22, 23sylancr 599 . . . . 5 (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
25 df-ima 5669 . . . . . 6 (𝑅1 “ On) = ran (𝑅1 ↾ On)
26 funrel 6582 . . . . . . . . 9 (Fun 𝑅1 → Rel 𝑅1)
2716, 26ax-mp 5 . . . . . . . 8 Rel 𝑅1
28 r1dmlim 9807 . . . . . . . . 9 Lim dom 𝑅1
29 limord 6448 . . . . . . . . 9 (Lim dom 𝑅1 → Ord dom 𝑅1)
30 ordsson 7829 . . . . . . . . 9 (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
3128, 29, 30mp2b 10 . . . . . . . 8 dom 𝑅1 ⊆ On
32 relssres 6027 . . . . . . . 8 ((Rel 𝑅1 ∧ dom 𝑅1 ⊆ On) → (𝑅1 ↾ On) = 𝑅1)
3327, 31, 32mp2an 705 . . . . . . 7 (𝑅1 ↾ On) = 𝑅1
3433rneqi 5929 . . . . . 6 ran (𝑅1 ↾ On) = ran 𝑅1
3525, 34eqtri 2786 . . . . 5 (𝑅1 “ On) = ran 𝑅1
3624, 35eleqtrrdi 2875 . . . 4 (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On))
37 elunii 4875 . . . 4 ((𝐴 ∈ (𝑅1‘suc 𝑥) ∧ (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On)) → 𝐴 ∈ ∪ (𝑅1 “ On))
3836, 37mpdan 700 . . 3 (𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ ∪ (𝑅1 “ On))
3938rexlimivw 3163 . 2 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ ∪ (𝑅1 “ On))
4021, 39impbii 212 1 (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4870  Tr wtr 5216  dom cdm 5656  ran crn 5657   ↾ cres 5658   “ cima 5659  Rel wrel 5661  Ord word 6385  Oncon0 6386  Lim wlim 6387  suc csuc 6388  Fun wfun 6558  ‘cfv 6564  𝑅1cr1 9801
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6328  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-ov 7452  df-om 7910  df-2nd 8034  df-frecs 8335  df-wrecs 8366  df-recs 8415  df-rdg 8454  df-r1 9803
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator