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

Theorem reftr 23888
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 2763 . . . 4 ∪ 𝐵 = ∪ 𝐵
2 eqid 2763 . . . 4 ∪ 𝐶 = ∪ 𝐶
31, 2refbas 23884 . . 3 (𝐵Ref𝐶 → ∪ 𝐶 = ∪ 𝐵)
4 eqid 2763 . . . 4 ∪ 𝐴 = ∪ 𝐴
54, 1refbas 23884 . . 3 (𝐴Ref𝐵 → ∪ 𝐵 = ∪ 𝐴)
63, 5sylan9eqr 2820 . 2 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → ∪ 𝐶 = ∪ 𝐴)
7 refssex 23885 . . . . . 6 ((𝐴Ref𝐵 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦)
87ex 418 . . . . 5 (𝐴Ref𝐵 → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
98adantr 486 . . . 4 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → (𝑥 ∈ 𝐴 → ∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦))
10 refssex 23885 . . . . . . 7 ((𝐵Ref𝐶 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 ∈ 𝐶 𝑦 ⊆ 𝑧)
1110ad2ant2lr 761 . . . . . 6 (((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ⊆ 𝑦)) → ∃𝑧 ∈ 𝐶 𝑦 ⊆ 𝑧)
12 sstr2 3920 . . . . . . . 8 (𝑥 ⊆ 𝑦 → (𝑦 ⊆ 𝑧 → 𝑥 ⊆ 𝑧))
1312reximdv 3181 . . . . . . 7 (𝑥 ⊆ 𝑦 → (∃𝑧 ∈ 𝐶 𝑦 ⊆ 𝑧 → ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧))
1413ad2antll 742 . . . . . 6 (((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ⊆ 𝑦)) → (∃𝑧 ∈ 𝐶 𝑦 ⊆ 𝑧 → ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧))
1511, 14mpd 16 . . . . 5 (((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑥 ⊆ 𝑦)) → ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧)
1615rexlimdvaa 3168 . . . 4 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → (∃𝑦 ∈ 𝐵 𝑥 ⊆ 𝑦 → ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧))
179, 16syld 48 . . 3 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → (𝑥 ∈ 𝐴 → ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧))
1817ralrimiv 3157 . 2 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → ∀𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧)
19 refrel 23882 . . . . 5 Rel Ref
2019brrelex1i 5714 . . . 4 (𝐴Ref𝐵 → 𝐴 ∈ V)
2120adantr 486 . . 3 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → 𝐴 ∈ V)
224, 2isref 23883 . . 3 (𝐴 ∈ V → (𝐴Ref𝐶 ↔ (∪ 𝐶 = ∪ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧)))
2321, 22syl 18 . 2 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → (𝐴Ref𝐶 ↔ (∪ 𝐶 = ∪ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑧 ∈ 𝐶 𝑥 ⊆ 𝑧)))
246, 18, 23mpbir2and 726 1 ((𝐴Ref𝐵 ∧ 𝐵Ref𝐶) → 𝐴Ref𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872   class class class wbr 5108  Refcref 23876
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-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  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 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-ref 23879
This theorem is used by:  refssfne  37361
  Copyright terms: Public domain W3C validator