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

Theorem reftr 23479
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 2736 . . . 4 𝐵 = 𝐵
2 eqid 2736 . . . 4 𝐶 = 𝐶
31, 2refbas 23475 . . 3 (𝐵Ref𝐶 𝐶 = 𝐵)
4 eqid 2736 . . . 4 𝐴 = 𝐴
54, 1refbas 23475 . . 3 (𝐴Ref𝐵 𝐵 = 𝐴)
63, 5sylan9eqr 2793 . 2 ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐶 = 𝐴)
7 refssex 23476 . . . . . 6 ((𝐴Ref𝐵𝑥𝐴) → ∃𝑦𝐵 𝑥𝑦)
87ex 412 . . . . 5 (𝐴Ref𝐵 → (𝑥𝐴 → ∃𝑦𝐵 𝑥𝑦))
98adantr 480 . . . 4 ((𝐴Ref𝐵𝐵Ref𝐶) → (𝑥𝐴 → ∃𝑦𝐵 𝑥𝑦))
10 refssex 23476 . . . . . . 7 ((𝐵Ref𝐶𝑦𝐵) → ∃𝑧𝐶 𝑦𝑧)
1110ad2ant2lr 749 . . . . . 6 (((𝐴Ref𝐵𝐵Ref𝐶) ∧ (𝑦𝐵𝑥𝑦)) → ∃𝑧𝐶 𝑦𝑧)
12 sstr2 3928 . . . . . . . 8 (𝑥𝑦 → (𝑦𝑧𝑥𝑧))
1312reximdv 3152 . . . . . . 7 (𝑥𝑦 → (∃𝑧𝐶 𝑦𝑧 → ∃𝑧𝐶 𝑥𝑧))
1413ad2antll 730 . . . . . 6 (((𝐴Ref𝐵𝐵Ref𝐶) ∧ (𝑦𝐵𝑥𝑦)) → (∃𝑧𝐶 𝑦𝑧 → ∃𝑧𝐶 𝑥𝑧))
1511, 14mpd 15 . . . . 5 (((𝐴Ref𝐵𝐵Ref𝐶) ∧ (𝑦𝐵𝑥𝑦)) → ∃𝑧𝐶 𝑥𝑧)
1615rexlimdvaa 3139 . . . 4 ((𝐴Ref𝐵𝐵Ref𝐶) → (∃𝑦𝐵 𝑥𝑦 → ∃𝑧𝐶 𝑥𝑧))
179, 16syld 47 . . 3 ((𝐴Ref𝐵𝐵Ref𝐶) → (𝑥𝐴 → ∃𝑧𝐶 𝑥𝑧))
1817ralrimiv 3128 . 2 ((𝐴Ref𝐵𝐵Ref𝐶) → ∀𝑥𝐴𝑧𝐶 𝑥𝑧)
19 refrel 23473 . . . . 5 Rel Ref
2019brrelex1i 5687 . . . 4 (𝐴Ref𝐵𝐴 ∈ V)
2120adantr 480 . . 3 ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐴 ∈ V)
224, 2isref 23474 . . 3 (𝐴 ∈ V → (𝐴Ref𝐶 ↔ ( 𝐶 = 𝐴 ∧ ∀𝑥𝐴𝑧𝐶 𝑥𝑧)))
2321, 22syl 17 . 2 ((𝐴Ref𝐵𝐵Ref𝐶) → (𝐴Ref𝐶 ↔ ( 𝐶 = 𝐴 ∧ ∀𝑥𝐴𝑧𝐶 𝑥𝑧)))
246, 18, 23mpbir2and 714 1 ((𝐴Ref𝐵𝐵Ref𝐶) → 𝐴Ref𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3051  wrex 3061  Vcvv 3429  wss 3889   cuni 4850   class class class wbr 5085  Refcref 23467
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-ref 23470
This theorem is referenced by:  refssfne  36540
  Copyright terms: Public domain W3C validator