Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  prsdm Structured version   Visualization version   GIF version

Theorem prsdm 34657
Description: Domain of the relation of a proset. (Contributed by Thierry Arnoux, 11-Sep-2015.)
Hypotheses
Ref Expression
ordtNEW.b 𝐵 = (Base‘𝐾)
ordtNEW.l ≤ = ((le‘𝐾) ∩ (𝐵 × 𝐵))
Assertion
Ref Expression
prsdm (𝐾 ∈ Proset → dom ≤ = 𝐵)

Proof of Theorem prsdm
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ordtNEW.l . . . . 5 ≤ = ((le‘𝐾) ∩ (𝐵 × 𝐵))
21dmeqi 5898 . . . 4 dom ≤ = dom ((le‘𝐾) ∩ (𝐵 × 𝐵))
32eleq2i 2856 . . 3 (𝑥 ∈ dom ≤ ↔ 𝑥 ∈ dom ((le‘𝐾) ∩ (𝐵 × 𝐵)))
4 vex 3458 . . . . 5 𝑥 ∈ V
54eldm2 5895 . . . 4 (𝑥 ∈ dom ((le‘𝐾) ∩ (𝐵 × 𝐵)) ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)))
6 ordtNEW.b . . . . . . . . . 10 𝐵 = (Base‘𝐾)
7 eqid 2763 . . . . . . . . . 10 (le‘𝐾) = (le‘𝐾)
86, 7prsref 18522 . . . . . . . . 9 ((𝐾 ∈ Proset ∧ 𝑥 ∈ 𝐵) → 𝑥(le‘𝐾)𝑥)
9 df-br 5109 . . . . . . . . 9 (𝑥(le‘𝐾)𝑥 ↔ ⟨𝑥, 𝑥⟩ ∈ (le‘𝐾))
108, 9sylib 221 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝑥 ∈ 𝐵) → ⟨𝑥, 𝑥⟩ ∈ (le‘𝐾))
11 simpr 490 . . . . . . . . 9 ((𝐾 ∈ Proset ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝐵)
1211, 11opelxpd 5697 . . . . . . . 8 ((𝐾 ∈ Proset ∧ 𝑥 ∈ 𝐵) → ⟨𝑥, 𝑥⟩ ∈ (𝐵 × 𝐵))
1310, 12elind 4100 . . . . . . 7 ((𝐾 ∈ Proset ∧ 𝑥 ∈ 𝐵) → ⟨𝑥, 𝑥⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)))
14 opeq2 4846 . . . . . . . . 9 (𝑦 = 𝑥 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝑥⟩)
1514eleq1d 2849 . . . . . . . 8 (𝑦 = 𝑥 → (⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)) ↔ ⟨𝑥, 𝑥⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵))))
164, 15spcev 3564 . . . . . . 7 (⟨𝑥, 𝑥⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)) → ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)))
1713, 16syl 18 . . . . . 6 ((𝐾 ∈ Proset ∧ 𝑥 ∈ 𝐵) → ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)))
1817ex 418 . . . . 5 (𝐾 ∈ Proset → (𝑥 ∈ 𝐵 → ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵))))
19 elinel2 4102 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)) → ⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵))
20 opelxp1 5700 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝐵 × 𝐵) → 𝑥 ∈ 𝐵)
2119, 20syl 18 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)) → 𝑥 ∈ 𝐵)
2221exlimiv 1965 . . . . 5 (∃𝑦⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵)) → 𝑥 ∈ 𝐵)
2318, 22impbid1 228 . . . 4 (𝐾 ∈ Proset → (𝑥 ∈ 𝐵 ↔ ∃𝑦⟨𝑥, 𝑦⟩ ∈ ((le‘𝐾) ∩ (𝐵 × 𝐵))))
245, 23bitr4id 293 . . 3 (𝐾 ∈ Proset → (𝑥 ∈ dom ((le‘𝐾) ∩ (𝐵 × 𝐵)) ↔ 𝑥 ∈ 𝐵))
253, 24bitrid 286 . 2 (𝐾 ∈ Proset → (𝑥 ∈ dom ≤ ↔ 𝑥 ∈ 𝐵))
2625eqrdv 2761 1 (𝐾 ∈ Proset → dom ≤ = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ∩ cin 4092  ⟨cop 4840   class class class wbr 5108   × cxp 5656  dom cdm 5658  ‘cfv 6566  Basecbs 17431  lecple 17479   Proset cproset 18516
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-nul 5266  ax-pr 5398
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-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-dm 5668  df-iota 6520  df-fv 6574  df-proset 18518
This theorem is used by:  prsssdm  34660  ordtprsval  34661  ordtprsuni  34662  ordtrestNEW  34664  ordtconnlem1  34667
  Copyright terms: Public domain W3C validator