| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltdfpr | GIF version | ||
| Description: More convenient form of df-iltp 7733. (Contributed by Jim Kingdon, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| ltdfpr | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-br 4094 | . . 3 ⊢ (𝐴<P 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ <P ) | |
| 2 | df-iltp 7733 | . . . 4 ⊢ <P = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))} | |
| 3 | 2 | eleq2i 2298 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ <P ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))}) |
| 4 | 1, 3 | bitri 184 | . 2 ⊢ (𝐴<P 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))}) |
| 5 | simpl 109 | . . . . . . 7 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑥 = 𝐴) | |
| 6 | 5 | fveq2d 5652 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (2nd ‘𝑥) = (2nd ‘𝐴)) |
| 7 | 6 | eleq2d 2301 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑞 ∈ (2nd ‘𝑥) ↔ 𝑞 ∈ (2nd ‘𝐴))) |
| 8 | simpr 110 | . . . . . . 7 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵) | |
| 9 | 8 | fveq2d 5652 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (1st ‘𝑦) = (1st ‘𝐵)) |
| 10 | 9 | eleq2d 2301 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑞 ∈ (1st ‘𝑦) ↔ 𝑞 ∈ (1st ‘𝐵))) |
| 11 | 7, 10 | anbi12d 473 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)) ↔ (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| 12 | 11 | rexbidv 2534 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)) ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| 13 | 12 | opelopab2a 4365 | . 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))} ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| 14 | 4, 13 | bitrid 192 | 1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2202 ∃wrex 2512 〈cop 3676 class class class wbr 4093 {copab 4154 ‘cfv 5333 1st c1st 6310 2nd c2nd 6311 Qcnq 7543 Pcnp 7554 <P cltp 7558 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-br 4094 df-opab 4156 df-iota 5293 df-fv 5341 df-iltp 7733 |
| This theorem is referenced by: nqprl 7814 nqpru 7815 ltprordil 7852 ltnqpr 7856 ltnqpri 7857 ltpopr 7858 ltsopr 7859 ltaddpr 7860 ltexprlemm 7863 ltexprlemopu 7866 ltexprlemru 7875 aptiprleml 7902 aptiprlemu 7903 archpr 7906 cauappcvgprlem2 7923 caucvgprlem2 7943 caucvgprprlemopu 7962 caucvgprprlemexbt 7969 caucvgprprlem2 7973 suplocexprlemloc 7984 suplocexprlemub 7986 suplocexprlemlub 7987 |
| Copyright terms: Public domain | W3C validator |