| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ltdfpr | GIF version | ||
| Description: More convenient form of df-iltp 7653. (Contributed by Jim Kingdon, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| ltdfpr | ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴<P 𝐵 ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-br 4083 | . . 3 ⊢ (𝐴<P 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ <P ) | |
| 2 | df-iltp 7653 | . . . 4 ⊢ <P = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)))} | |
| 3 | 2 | eleq2i 2296 | . . 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 5630 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (2nd ‘𝑥) = (2nd ‘𝐴)) |
| 7 | 6 | eleq2d 2299 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑞 ∈ (2nd ‘𝑥) ↔ 𝑞 ∈ (2nd ‘𝐴))) |
| 8 | simpr 110 | . . . . . . 7 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵) | |
| 9 | 8 | fveq2d 5630 | . . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (1st ‘𝑦) = (1st ‘𝐵)) |
| 10 | 9 | eleq2d 2299 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑞 ∈ (1st ‘𝑦) ↔ 𝑞 ∈ (1st ‘𝐵))) |
| 11 | 7, 10 | anbi12d 473 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)) ↔ (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| 12 | 11 | rexbidv 2531 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝑥) ∧ 𝑞 ∈ (1st ‘𝑦)) ↔ ∃𝑞 ∈ Q (𝑞 ∈ (2nd ‘𝐴) ∧ 𝑞 ∈ (1st ‘𝐵)))) |
| 13 | 12 | opelopab2a 4352 | . 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 1395 ∈ wcel 2200 ∃wrex 2509 〈cop 3669 class class class wbr 4082 {copab 4143 ‘cfv 5317 1st c1st 6282 2nd c2nd 6283 Qcnq 7463 Pcnp 7474 <P cltp 7478 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-iota 5277 df-fv 5325 df-iltp 7653 |
| This theorem is referenced by: nqprl 7734 nqpru 7735 ltprordil 7772 ltnqpr 7776 ltnqpri 7777 ltpopr 7778 ltsopr 7779 ltaddpr 7780 ltexprlemm 7783 ltexprlemopu 7786 ltexprlemru 7795 aptiprleml 7822 aptiprlemu 7823 archpr 7826 cauappcvgprlem2 7843 caucvgprlem2 7863 caucvgprprlemopu 7882 caucvgprprlemexbt 7889 caucvgprprlem2 7893 suplocexprlemloc 7904 suplocexprlemub 7906 suplocexprlemlub 7907 |
| Copyright terms: Public domain | W3C validator |