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

Theorem recexprlemdisj 6756
Description: 𝐵 is disjoint. Lemma for recexpr 6764. (Contributed by Jim Kingdon, 27-Dec-2019.)
Hypothesis
Ref Expression
recexpr.1 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <Q 𝑥 ∧ (*Q𝑦) ∈ (1st𝐴))}⟩
Assertion
Ref Expression
recexprlemdisj (𝐴P → ∀𝑞Q ¬ (𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)))
Distinct variable groups:   𝑥,𝑞,𝑦,𝐴   𝐵,𝑞,𝑥,𝑦

Proof of Theorem recexprlemdisj
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ltsonq 6524 . . . . . 6 <Q Or Q
2 ltrelnq 6491 . . . . . 6 <Q ⊆ (Q × Q)
31, 2son2lpi 4746 . . . . 5 ¬ ((*Q𝑧) <Q (*Q𝑦) ∧ (*Q𝑦) <Q (*Q𝑧))
4 simprr 492 . . . . . . . . . 10 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → (*Q𝑧) ∈ (1st𝐴))
5 simplr 490 . . . . . . . . . 10 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → (*Q𝑦) ∈ (2nd𝐴))
64, 5jca 294 . . . . . . . . 9 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → ((*Q𝑧) ∈ (1st𝐴) ∧ (*Q𝑦) ∈ (2nd𝐴)))
7 prop 6601 . . . . . . . . . . 11 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
8 prltlu 6613 . . . . . . . . . . 11 ((⟨(1st𝐴), (2nd𝐴)⟩ ∈ P ∧ (*Q𝑧) ∈ (1st𝐴) ∧ (*Q𝑦) ∈ (2nd𝐴)) → (*Q𝑧) <Q (*Q𝑦))
97, 8syl3an1 1177 . . . . . . . . . 10 ((𝐴P ∧ (*Q𝑧) ∈ (1st𝐴) ∧ (*Q𝑦) ∈ (2nd𝐴)) → (*Q𝑧) <Q (*Q𝑦))
1093expb 1114 . . . . . . . . 9 ((𝐴P ∧ ((*Q𝑧) ∈ (1st𝐴) ∧ (*Q𝑦) ∈ (2nd𝐴))) → (*Q𝑧) <Q (*Q𝑦))
116, 10sylan2 274 . . . . . . . 8 ((𝐴P ∧ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴)))) → (*Q𝑧) <Q (*Q𝑦))
12 simprl 491 . . . . . . . . . . 11 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → 𝑧 <Q 𝑞)
13 simpll 489 . . . . . . . . . . 11 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → 𝑞 <Q 𝑦)
141, 2sotri 4745 . . . . . . . . . . 11 ((𝑧 <Q 𝑞𝑞 <Q 𝑦) → 𝑧 <Q 𝑦)
1512, 13, 14syl2anc 397 . . . . . . . . . 10 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → 𝑧 <Q 𝑦)
16 ltrnqi 6547 . . . . . . . . . 10 (𝑧 <Q 𝑦 → (*Q𝑦) <Q (*Q𝑧))
1715, 16syl 14 . . . . . . . . 9 (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → (*Q𝑦) <Q (*Q𝑧))
1817adantl 266 . . . . . . . 8 ((𝐴P ∧ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴)))) → (*Q𝑦) <Q (*Q𝑧))
1911, 18jca 294 . . . . . . 7 ((𝐴P ∧ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴)))) → ((*Q𝑧) <Q (*Q𝑦) ∧ (*Q𝑦) <Q (*Q𝑧)))
2019ex 112 . . . . . 6 (𝐴P → (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → ((*Q𝑧) <Q (*Q𝑦) ∧ (*Q𝑦) <Q (*Q𝑧))))
2120adantr 265 . . . . 5 ((𝐴P𝑞Q) → (((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) → ((*Q𝑧) <Q (*Q𝑦) ∧ (*Q𝑦) <Q (*Q𝑧))))
223, 21mtoi 598 . . . 4 ((𝐴P𝑞Q) → ¬ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
2322alrimivv 1769 . . 3 ((𝐴P𝑞Q) → ∀𝑦𝑧 ¬ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
24 recexpr.1 . . . . . . . . 9 𝐵 = ⟨{𝑥 ∣ ∃𝑦(𝑥 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴))}, {𝑥 ∣ ∃𝑦(𝑦 <Q 𝑥 ∧ (*Q𝑦) ∈ (1st𝐴))}⟩
2524recexprlemell 6748 . . . . . . . 8 (𝑞 ∈ (1st𝐵) ↔ ∃𝑦(𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)))
2624recexprlemelu 6749 . . . . . . . 8 (𝑞 ∈ (2nd𝐵) ↔ ∃𝑦(𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)))
2725, 26anbi12i 441 . . . . . . 7 ((𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)) ↔ (∃𝑦(𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ ∃𝑦(𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴))))
28 breq1 3792 . . . . . . . . . 10 (𝑦 = 𝑧 → (𝑦 <Q 𝑞𝑧 <Q 𝑞))
29 fveq2 5203 . . . . . . . . . . 11 (𝑦 = 𝑧 → (*Q𝑦) = (*Q𝑧))
3029eleq1d 2120 . . . . . . . . . 10 (𝑦 = 𝑧 → ((*Q𝑦) ∈ (1st𝐴) ↔ (*Q𝑧) ∈ (1st𝐴)))
3128, 30anbi12d 450 . . . . . . . . 9 (𝑦 = 𝑧 → ((𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)) ↔ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
3231cbvexv 1809 . . . . . . . 8 (∃𝑦(𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴)) ↔ ∃𝑧(𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴)))
3332anbi2i 438 . . . . . . 7 ((∃𝑦(𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ ∃𝑦(𝑦 <Q 𝑞 ∧ (*Q𝑦) ∈ (1st𝐴))) ↔ (∃𝑦(𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ ∃𝑧(𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
3427, 33bitri 177 . . . . . 6 ((𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)) ↔ (∃𝑦(𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ ∃𝑧(𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
35 eeanv 1821 . . . . . 6 (∃𝑦𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) ↔ (∃𝑦(𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ ∃𝑧(𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
3634, 35bitr4i 180 . . . . 5 ((𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)) ↔ ∃𝑦𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
3736notbii 602 . . . 4 (¬ (𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)) ↔ ¬ ∃𝑦𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
38 alnex 1402 . . . . . 6 (∀𝑧 ¬ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) ↔ ¬ ∃𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
3938albii 1373 . . . . 5 (∀𝑦𝑧 ¬ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) ↔ ∀𝑦 ¬ ∃𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
40 alnex 1402 . . . . 5 (∀𝑦 ¬ ∃𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) ↔ ¬ ∃𝑦𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
4139, 40bitri 177 . . . 4 (∀𝑦𝑧 ¬ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))) ↔ ¬ ∃𝑦𝑧((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
4237, 41bitr4i 180 . . 3 (¬ (𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)) ↔ ∀𝑦𝑧 ¬ ((𝑞 <Q 𝑦 ∧ (*Q𝑦) ∈ (2nd𝐴)) ∧ (𝑧 <Q 𝑞 ∧ (*Q𝑧) ∈ (1st𝐴))))
4323, 42sylibr 141 . 2 ((𝐴P𝑞Q) → ¬ (𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)))
4443ralrimiva 2407 1 (𝐴P → ∀𝑞Q ¬ (𝑞 ∈ (1st𝐵) ∧ 𝑞 ∈ (2nd𝐵)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 101  wal 1255   = wceq 1257  wex 1395  wcel 1407  {cab 2040  wral 2321  cop 3403   class class class wbr 3789  cfv 4927  1st c1st 5790  2nd c2nd 5791  Qcnq 6406  *Qcrq 6410   <Q cltq 6411  Pcnp 6417
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 552  ax-in2 553  ax-io 638  ax-5 1350  ax-7 1351  ax-gen 1352  ax-ie1 1396  ax-ie2 1397  ax-8 1409  ax-10 1410  ax-11 1411  ax-i12 1412  ax-bndl 1413  ax-4 1414  ax-13 1418  ax-14 1419  ax-17 1433  ax-i9 1437  ax-ial 1441  ax-i5r 1442  ax-ext 2036  ax-coll 3897  ax-sep 3900  ax-nul 3908  ax-pow 3952  ax-pr 3969  ax-un 4195  ax-setind 4287  ax-iinf 4336
This theorem depends on definitions:  df-bi 114  df-dc 752  df-3or 895  df-3an 896  df-tru 1260  df-fal 1263  df-nf 1364  df-sb 1660  df-eu 1917  df-mo 1918  df-clab 2041  df-cleq 2047  df-clel 2050  df-nfc 2181  df-ne 2219  df-ral 2326  df-rex 2327  df-reu 2328  df-rab 2330  df-v 2574  df-sbc 2785  df-csb 2878  df-dif 2945  df-un 2947  df-in 2949  df-ss 2956  df-nul 3250  df-pw 3386  df-sn 3406  df-pr 3407  df-op 3409  df-uni 3606  df-int 3641  df-iun 3684  df-br 3790  df-opab 3844  df-mpt 3845  df-tr 3880  df-eprel 4051  df-id 4055  df-po 4058  df-iso 4059  df-iord 4128  df-on 4130  df-suc 4133  df-iom 4339  df-xp 4376  df-rel 4377  df-cnv 4378  df-co 4379  df-dm 4380  df-rn 4381  df-res 4382  df-ima 4383  df-iota 4892  df-fun 4929  df-fn 4930  df-f 4931  df-f1 4932  df-fo 4933  df-f1o 4934  df-fv 4935  df-ov 5540  df-oprab 5541  df-mpt2 5542  df-1st 5792  df-2nd 5793  df-recs 5948  df-irdg 5985  df-1o 6029  df-oadd 6033  df-omul 6034  df-er 6134  df-ec 6136  df-qs 6140  df-ni 6430  df-mi 6432  df-lti 6433  df-mpq 6471  df-enq 6473  df-nqqs 6474  df-mqqs 6476  df-1nqqs 6477  df-rq 6478  df-ltnqqs 6479  df-inp 6592
This theorem is referenced by:  recexprlempr  6758
  Copyright terms: Public domain W3C validator