ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ltdfpr GIF version

Theorem ltdfpr 7879
Description: More convenient form of df-iltp 7843. (Contributed by Jim Kingdon, 15-Dec-2019.)
Assertion
Ref Expression
ltdfpr ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵))))
Distinct variable groups:   𝐴,𝑞   𝐵,𝑞

Proof of Theorem ltdfpr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-br 4132 . . 3 (𝐴<P 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ <P )
2 df-iltp 7843 . . . 4 <P = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))}
32eleq2i 2305 . . 3 (⟨𝐴, 𝐵⟩ ∈ <P ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))})
41, 3bitri 184 . 2 (𝐴<P 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))})
5 simpl 109 . . . . . . 7 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴)
65fveq2d 5702 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (2nd ‘𝑥) = (2nd ‘𝐴))
76eleq2d 2308 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑞 ∈ (2nd ‘𝑥) ↔ 𝑞 ∈ (2nd ‘𝐴)))
8 simpr 110 . . . . . . 7 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
98fveq2d 5702 . . . . . 6 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (1st ‘𝑦) = (1st ‘𝐵))
109eleq2d 2308 . . . . 5 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑞 ∈ (1st ‘𝑦) ↔ 𝑞 ∈ (1st ‘𝐵)))
117, 10anbi12d 477 . . . 4 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)) ↔ (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵))))
1211rexbidv 2551 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)) ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵))))
1312opelopab2a 4409 . 2 ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))} ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵))))
144, 13bitrid 192 1 ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵))))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  ⟨cop 3712   class class class wbr 4131  {copab 4192  ‘cfv 5380  1st c1st 6376  2nd c2nd 6377  Qcnq 7653  Pcnp 7664  <P cltp 7668
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4132  df-opab 4194  df-iota 5340  df-fv 5388  df-iltp 7843
This theorem is used by:  nqprl  7924  nqpru  7925  ltprordil  7962  ltnqpr  7966  ltnqpri  7967  ltpopr  7968  ltsopr  7969  ltaddpr  7970  ltexprlemm  7973  ltexprlemopu  7976  ltexprlemru  7985  aptiprleml  8012  aptiprlemu  8013  archpr  8016  cauappcvgprlem2  8033  caucvgprlem2  8053  caucvgprprlemopu  8072  caucvgprprlemexbt  8079  caucvgprprlem2  8083  suplocexprlemloc  8094  suplocexprlemub  8096  suplocexprlemlub  8097
  Copyright terms: Public domain W3C validator