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

Theorem rncoOLD 6259
Description: Obsolete version of rnco 6258 as of 24-Jan-2026. (Contributed by NM, 12-Dec-2006.) (Proof shortened by Peter Mazsa, 2-Oct-2022.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
rncoOLD ran (𝐴𝐵) = ran (𝐴 ↾ ran 𝐵)

Proof of Theorem rncoOLD
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3462 . . . . . 6 𝑥 ∈ V
2 vex 3462 . . . . . 6 𝑦 ∈ V
31, 2brco 5861 . . . . 5 (𝑥(𝐴𝐵)𝑦 ↔ ∃𝑧(𝑥𝐵𝑧𝑧𝐴𝑦))
43exbii 1881 . . . 4 (∃𝑥 𝑥(𝐴𝐵)𝑦 ↔ ∃𝑥𝑧(𝑥𝐵𝑧𝑧𝐴𝑦))
5 excom 2200 . . . 4 (∃𝑥𝑧(𝑥𝐵𝑧𝑧𝐴𝑦) ↔ ∃𝑧𝑥(𝑥𝐵𝑧𝑧𝐴𝑦))
6 vex 3462 . . . . . . . 8 𝑧 ∈ V
76elrn 5888 . . . . . . 7 (𝑧 ∈ ran 𝐵 ↔ ∃𝑥 𝑥𝐵𝑧)
87anbi1i 636 . . . . . 6 ((𝑧 ∈ ran 𝐵𝑧𝐴𝑦) ↔ (∃𝑥 𝑥𝐵𝑧𝑧𝐴𝑦))
92brresi 5992 . . . . . 6 (𝑧(𝐴 ↾ ran 𝐵)𝑦 ↔ (𝑧 ∈ ran 𝐵𝑧𝐴𝑦))
10 19.41v 1982 . . . . . 6 (∃𝑥(𝑥𝐵𝑧𝑧𝐴𝑦) ↔ (∃𝑥 𝑥𝐵𝑧𝑧𝐴𝑦))
118, 9, 103bitr4ri 307 . . . . 5 (∃𝑥(𝑥𝐵𝑧𝑧𝐴𝑦) ↔ 𝑧(𝐴 ↾ ran 𝐵)𝑦)
1211exbii 1881 . . . 4 (∃𝑧𝑥(𝑥𝐵𝑧𝑧𝐴𝑦) ↔ ∃𝑧 𝑧(𝐴 ↾ ran 𝐵)𝑦)
134, 5, 123bitri 300 . . 3 (∃𝑥 𝑥(𝐴𝐵)𝑦 ↔ ∃𝑧 𝑧(𝐴 ↾ ran 𝐵)𝑦)
142elrn 5888 . . 3 (𝑦 ∈ ran (𝐴𝐵) ↔ ∃𝑥 𝑥(𝐴𝐵)𝑦)
152elrn 5888 . . 3 (𝑦 ∈ ran (𝐴 ↾ ran 𝐵) ↔ ∃𝑧 𝑧(𝐴 ↾ ran 𝐵)𝑦)
1613, 14, 153bitr4i 306 . 2 (𝑦 ∈ ran (𝐴𝐵) ↔ 𝑦 ∈ ran (𝐴 ↾ ran 𝐵))
1716eqriv 2763 1 ran (𝐴𝐵) = ran (𝐴 ↾ ran 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wex 1812  wcel 2146   class class class wbr 5114  ran crn 5667  cres 5668  ccom 5670
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator