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

Theorem r1elss 9495
Description: The range of the 𝑅1 function is transitive. Lemma 2.10 of [Kunen] p. 97. (Contributed by Mario Carneiro, 22-Mar-2013.) (Revised by Mario Carneiro, 16-Nov-2014.)
Hypothesis
Ref Expression
r1elss.1 𝐴 ∈ V
Assertion
Ref Expression
r1elss (𝐴 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On))

Proof of Theorem r1elss
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 r1elssi 9494 . 2 (𝐴 (𝑅1 “ On) → 𝐴 (𝑅1 “ On))
2 r1elss.1 . . . 4 𝐴 ∈ V
32tz9.12 9479 . . 3 (∀𝑦𝐴𝑥 ∈ On 𝑦 ∈ (𝑅1𝑥) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥))
4 dfss3 3905 . . . 4 (𝐴 (𝑅1 “ On) ↔ ∀𝑦𝐴 𝑦 (𝑅1 “ On))
5 r1fnon 9456 . . . . . . . 8 𝑅1 Fn On
6 fnfun 6517 . . . . . . . 8 (𝑅1 Fn On → Fun 𝑅1)
7 funiunfv 7103 . . . . . . . 8 (Fun 𝑅1 𝑥 ∈ On (𝑅1𝑥) = (𝑅1 “ On))
85, 6, 7mp2b 10 . . . . . . 7 𝑥 ∈ On (𝑅1𝑥) = (𝑅1 “ On)
98eleq2i 2830 . . . . . 6 (𝑦 𝑥 ∈ On (𝑅1𝑥) ↔ 𝑦 (𝑅1 “ On))
10 eliun 4925 . . . . . 6 (𝑦 𝑥 ∈ On (𝑅1𝑥) ↔ ∃𝑥 ∈ On 𝑦 ∈ (𝑅1𝑥))
119, 10bitr3i 276 . . . . 5 (𝑦 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝑦 ∈ (𝑅1𝑥))
1211ralbii 3090 . . . 4 (∀𝑦𝐴 𝑦 (𝑅1 “ On) ↔ ∀𝑦𝐴𝑥 ∈ On 𝑦 ∈ (𝑅1𝑥))
134, 12bitri 274 . . 3 (𝐴 (𝑅1 “ On) ↔ ∀𝑦𝐴𝑥 ∈ On 𝑦 ∈ (𝑅1𝑥))
148eleq2i 2830 . . . 4 (𝐴 𝑥 ∈ On (𝑅1𝑥) ↔ 𝐴 (𝑅1 “ On))
15 eliun 4925 . . . 4 (𝐴 𝑥 ∈ On (𝑅1𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥))
1614, 15bitr3i 276 . . 3 (𝐴 (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥))
173, 13, 163imtr4i 291 . 2 (𝐴 (𝑅1 “ On) → 𝐴 (𝑅1 “ On))
181, 17impbii 208 1 (𝐴 (𝑅1 “ On) ↔ 𝐴 (𝑅1 “ On))
Colors of variables: wff setvar class
Syntax hints:  wb 205   = wceq 1539  wcel 2108  wral 3063  wrex 3064  Vcvv 3422  wss 3883   cuni 4836   ciun 4921  cima 5583  Oncon0 6251  Fun wfun 6412   Fn wfn 6413  cfv 6418  𝑅1cr1 9451
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-r1 9453
This theorem is referenced by:  unir1  9502  tcwf  9572  tcrank  9573  rankcf  10464  wfgru  10503
  Copyright terms: Public domain W3C validator