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

Theorem reftr 22902
Description: Refinement is transitive. (Contributed by Jeff Hankins, 18-Jan-2010.) (Revised by Thierry Arnoux, 3-Feb-2020.)
Assertion
Ref Expression
reftr ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐴Ref𝐶)

Proof of Theorem reftr
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2731 . . . 4 𝐵 = 𝐵
2 eqid 2731 . . . 4 𝐶 = 𝐶
31, 2refbas 22898 . . 3 (𝐵Ref𝐶 𝐶 = 𝐵)
4 eqid 2731 . . . 4 𝐴 = 𝐴
54, 1refbas 22898 . . 3 (𝐴Ref𝐵 𝐵 = 𝐴)
63, 5sylan9eqr 2793 . 2 ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐶 = 𝐴)
7 refssex 22899 . . . . . 6 ((𝐴Ref𝐵𝑥𝐴) → ∃𝑦𝐵 𝑥𝑦)
87ex 413 . . . . 5 (𝐴Ref𝐵 → (𝑥𝐴 → ∃𝑦𝐵 𝑥𝑦))
98adantr 481 . . . 4 ((𝐴Ref𝐵𝐵Ref𝐶) → (𝑥𝐴 → ∃𝑦𝐵 𝑥𝑦))
10 refssex 22899 . . . . . . 7 ((𝐵Ref𝐶𝑦𝐵) → ∃𝑧𝐶 𝑦𝑧)
1110ad2ant2lr 746 . . . . . 6 (((𝐴Ref𝐵𝐵Ref𝐶) ∧ (𝑦𝐵𝑥𝑦)) → ∃𝑧𝐶 𝑦𝑧)
12 sstr2 3954 . . . . . . . 8 (𝑥𝑦 → (𝑦𝑧𝑥𝑧))
1312reximdv 3163 . . . . . . 7 (𝑥𝑦 → (∃𝑧𝐶 𝑦𝑧 → ∃𝑧𝐶 𝑥𝑧))
1413ad2antll 727 . . . . . 6 (((𝐴Ref𝐵𝐵Ref𝐶) ∧ (𝑦𝐵𝑥𝑦)) → (∃𝑧𝐶 𝑦𝑧 → ∃𝑧𝐶 𝑥𝑧))
1511, 14mpd 15 . . . . 5 (((𝐴Ref𝐵𝐵Ref𝐶) ∧ (𝑦𝐵𝑥𝑦)) → ∃𝑧𝐶 𝑥𝑧)
1615rexlimdvaa 3149 . . . 4 ((𝐴Ref𝐵𝐵Ref𝐶) → (∃𝑦𝐵 𝑥𝑦 → ∃𝑧𝐶 𝑥𝑧))
179, 16syld 47 . . 3 ((𝐴Ref𝐵𝐵Ref𝐶) → (𝑥𝐴 → ∃𝑧𝐶 𝑥𝑧))
1817ralrimiv 3138 . 2 ((𝐴Ref𝐵𝐵Ref𝐶) → ∀𝑥𝐴𝑧𝐶 𝑥𝑧)
19 refrel 22896 . . . . 5 Rel Ref
2019brrelex1i 5693 . . . 4 (𝐴Ref𝐵𝐴 ∈ V)
2120adantr 481 . . 3 ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐴 ∈ V)
224, 2isref 22897 . . 3 (𝐴 ∈ V → (𝐴Ref𝐶 ↔ ( 𝐶 = 𝐴 ∧ ∀𝑥𝐴𝑧𝐶 𝑥𝑧)))
2321, 22syl 17 . 2 ((𝐴Ref𝐵𝐵Ref𝐶) → (𝐴Ref𝐶 ↔ ( 𝐶 = 𝐴 ∧ ∀𝑥𝐴𝑧𝐶 𝑥𝑧)))
246, 18, 23mpbir2and 711 1 ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐴Ref𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3060  wrex 3069  Vcvv 3446  wss 3913   cuni 4870   class class class wbr 5110  Refcref 22890
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-ext 2702  ax-sep 5261  ax-nul 5268  ax-pow 5325  ax-pr 5389  ax-un 7677
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-rex 3070  df-rab 3406  df-v 3448  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4288  df-if 4492  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4871  df-br 5111  df-opab 5173  df-xp 5644  df-rel 5645  df-ref 22893
This theorem is referenced by:  refssfne  34906
  Copyright terms: Public domain W3C validator