MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  releldmdifi Structured version   Visualization version   GIF version

Theorem releldmdifi 8034
Description: One way of expressing membership in the difference of domains of two nested relations. (Contributed by AV, 26-Oct-2023.)
Assertion
Ref Expression
releldmdifi ((Rel 𝐴𝐵𝐴) → (𝐶 ∈ (dom 𝐴 ∖ dom 𝐵) → ∃𝑥 ∈ (𝐴𝐵)(1st𝑥) = 𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem releldmdifi
StepHypRef Expression
1 eldif 3959 . . 3 (𝐶 ∈ (dom 𝐴 ∖ dom 𝐵) ↔ (𝐶 ∈ dom 𝐴 ∧ ¬ 𝐶 ∈ dom 𝐵))
2 releldm2 8032 . . . . 5 (Rel 𝐴 → (𝐶 ∈ dom 𝐴 ↔ ∃𝑥𝐴 (1st𝑥) = 𝐶))
32adantr 480 . . . 4 ((Rel 𝐴𝐵𝐴) → (𝐶 ∈ dom 𝐴 ↔ ∃𝑥𝐴 (1st𝑥) = 𝐶))
43anbi1d 629 . . 3 ((Rel 𝐴𝐵𝐴) → ((𝐶 ∈ dom 𝐴 ∧ ¬ 𝐶 ∈ dom 𝐵) ↔ (∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵)))
51, 4bitrid 282 . 2 ((Rel 𝐴𝐵𝐴) → (𝐶 ∈ (dom 𝐴 ∖ dom 𝐵) ↔ (∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵)))
6 simprl 768 . . . 4 (((Rel 𝐴𝐵𝐴) ∧ (∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵)) → ∃𝑥𝐴 (1st𝑥) = 𝐶)
7 relss 5782 . . . . . . . . . . . 12 (𝐵𝐴 → (Rel 𝐴 → Rel 𝐵))
87impcom 407 . . . . . . . . . . 11 ((Rel 𝐴𝐵𝐴) → Rel 𝐵)
9 1stdm 8029 . . . . . . . . . . 11 ((Rel 𝐵𝑥𝐵) → (1st𝑥) ∈ dom 𝐵)
108, 9sylan 579 . . . . . . . . . 10 (((Rel 𝐴𝐵𝐴) ∧ 𝑥𝐵) → (1st𝑥) ∈ dom 𝐵)
11 eleq1 2820 . . . . . . . . . 10 ((1st𝑥) = 𝐶 → ((1st𝑥) ∈ dom 𝐵𝐶 ∈ dom 𝐵))
1210, 11syl5ibcom 244 . . . . . . . . 9 (((Rel 𝐴𝐵𝐴) ∧ 𝑥𝐵) → ((1st𝑥) = 𝐶𝐶 ∈ dom 𝐵))
1312rexlimdva 3154 . . . . . . . 8 ((Rel 𝐴𝐵𝐴) → (∃𝑥𝐵 (1st𝑥) = 𝐶𝐶 ∈ dom 𝐵))
1413con3d 152 . . . . . . 7 ((Rel 𝐴𝐵𝐴) → (¬ 𝐶 ∈ dom 𝐵 → ¬ ∃𝑥𝐵 (1st𝑥) = 𝐶))
15 ralnex 3071 . . . . . . 7 (∀𝑥𝐵 ¬ (1st𝑥) = 𝐶 ↔ ¬ ∃𝑥𝐵 (1st𝑥) = 𝐶)
1614, 15imbitrrdi 251 . . . . . 6 ((Rel 𝐴𝐵𝐴) → (¬ 𝐶 ∈ dom 𝐵 → ∀𝑥𝐵 ¬ (1st𝑥) = 𝐶))
1716adantld 490 . . . . 5 ((Rel 𝐴𝐵𝐴) → ((∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵) → ∀𝑥𝐵 ¬ (1st𝑥) = 𝐶))
1817imp 406 . . . 4 (((Rel 𝐴𝐵𝐴) ∧ (∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵)) → ∀𝑥𝐵 ¬ (1st𝑥) = 𝐶)
19 rexdifi 4146 . . . 4 ((∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ∀𝑥𝐵 ¬ (1st𝑥) = 𝐶) → ∃𝑥 ∈ (𝐴𝐵)(1st𝑥) = 𝐶)
206, 18, 19syl2anc 583 . . 3 (((Rel 𝐴𝐵𝐴) ∧ (∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵)) → ∃𝑥 ∈ (𝐴𝐵)(1st𝑥) = 𝐶)
2120ex 412 . 2 ((Rel 𝐴𝐵𝐴) → ((∃𝑥𝐴 (1st𝑥) = 𝐶 ∧ ¬ 𝐶 ∈ dom 𝐵) → ∃𝑥 ∈ (𝐴𝐵)(1st𝑥) = 𝐶))
225, 21sylbid 239 1 ((Rel 𝐴𝐵𝐴) → (𝐶 ∈ (dom 𝐴 ∖ dom 𝐵) → ∃𝑥 ∈ (𝐴𝐵)(1st𝑥) = 𝐶))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1540  wcel 2105  wral 3060  wrex 3069  cdif 3946  wss 3949  dom cdm 5677  Rel wrel 5682  cfv 6544  1st c1st 7976
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7728
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3432  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-int 4952  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-iota 6496  df-fun 6546  df-fv 6552  df-1st 7978  df-2nd 7979
This theorem is referenced by:  funeldmdif  8037  satffunlem2lem2  34692
  Copyright terms: Public domain W3C validator