ltexprlemrnd - Intuitionistic Logic Explorer

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

Theorem ltexprlemrnd 7689

Description: Our constructed difference is rounded. Lemma for ltexpri 7697. (Contributed by Jim Kingdon, 17-Dec-2019.)

**Hypothesis**
Ref	Expression
ltexprlem.1	⊢ 𝐶 = ⟨{𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (2^nd ‘𝐴) ∧ (𝑦 +_Q 𝑥) ∈ (1^st ‘𝐵))}, {𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑥) ∈ (2^nd ‘𝐵))}⟩

**Assertion**
Ref	Expression
ltexprlemrnd	⊢ (𝐴<_P 𝐵 → (∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘𝐶) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘𝐶) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)))))

Distinct variable groups: 𝑥,𝑦,𝑞,𝑟,𝐴 𝑥,𝐵,𝑦,𝑞,𝑟 𝑥,𝐶,𝑦,𝑞,𝑟

**Proof of Theorem ltexprlemrnd**
Step	Hyp	Ref	Expression
1		ltexprlem.1	. . . . . 6 ⊢ 𝐶 = ⟨{𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (2^nd ‘𝐴) ∧ (𝑦 +_Q 𝑥) ∈ (1^st ‘𝐵))}, {𝑥 ∈ Q ∣ ∃𝑦(𝑦 ∈ (1^st ‘𝐴) ∧ (𝑦 +_Q 𝑥) ∈ (2^nd ‘𝐵))}⟩
2	1	ltexprlemopl 7685	. . . . 5 ⊢ ((𝐴<_P 𝐵 ∧ 𝑞 ∈ Q ∧ 𝑞 ∈ (1^st ‘𝐶)) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)))
3	2	3expia 1207	. . . 4 ⊢ ((𝐴<_P 𝐵 ∧ 𝑞 ∈ Q) → (𝑞 ∈ (1^st ‘𝐶) → ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶))))
4	1	ltexprlemlol 7686	. . . 4 ⊢ ((𝐴<_P 𝐵 ∧ 𝑞 ∈ Q) → (∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶)) → 𝑞 ∈ (1^st ‘𝐶)))
5	3, 4	impbid 129	. . 3 ⊢ ((𝐴<_P 𝐵 ∧ 𝑞 ∈ Q) → (𝑞 ∈ (1^st ‘𝐶) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶))))
6	5	ralrimiva 2570	. 2 ⊢ (𝐴<_P 𝐵 → ∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘𝐶) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶))))
7	1	ltexprlemopu 7687	. . . . 5 ⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q ∧ 𝑟 ∈ (2^nd ‘𝐶)) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)))
8	7	3expia 1207	. . . 4 ⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) → (𝑟 ∈ (2^nd ‘𝐶) → ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶))))
9	1	ltexprlemupu 7688	. . . 4 ⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) → (∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)) → 𝑟 ∈ (2^nd ‘𝐶)))
10	8, 9	impbid 129	. . 3 ⊢ ((𝐴<_P 𝐵 ∧ 𝑟 ∈ Q) → (𝑟 ∈ (2^nd ‘𝐶) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶))))
11	10	ralrimiva 2570	. 2 ⊢ (𝐴<_P 𝐵 → ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘𝐶) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶))))
12	6, 11	jca 306	1 ⊢ (𝐴<_P 𝐵 → (∀𝑞 ∈ Q (𝑞 ∈ (1^st ‘𝐶) ↔ ∃𝑟 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑟 ∈ (1^st ‘𝐶))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2^nd ‘𝐶) ↔ ∃𝑞 ∈ Q (𝑞 <_Q 𝑟 ∧ 𝑞 ∈ (2^nd ‘𝐶)))))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∃wex 1506 ∈ wcel 2167 ∀wral 2475 ∃wrex 2476 {crab 2479 ⟨cop 3626 class class class wbr 4034 ‘cfv 5259 (class class class)co 5925 1^st c1st 6205 2^nd c2nd 6206 Qcnq 7364 +_Q cplq 7366 <_Q cltq 7369 <_P cltp 7379

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-in1 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-eprel 4325 df-id 4329 df-po 4332 df-iso 4333 df-iord 4402 df-on 4404 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-1o 6483 df-oadd 6487 df-omul 6488 df-er 6601 df-ec 6603 df-qs 6607 df-ni 7388 df-pli 7389 df-mi 7390 df-lti 7391 df-plpq 7428 df-mpq 7429 df-enq 7431 df-nqqs 7432 df-plqqs 7433 df-mqqs 7434 df-1nqqs 7435 df-ltnqqs 7437 df-inp 7550 df-iltp 7554

This theorem is referenced by: ltexprlempr 7692

W3C validator