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

Theorem oprssdmm 6069
Description: Domain of closure of an operation. (Contributed by Jim Kingdon, 23-Oct-2023.)
Hypotheses
Ref Expression
oprssdmm.m ((𝜑𝑢𝑆) → ∃𝑣 𝑣𝑢)
oprssdmm.cl ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
oprssdmm.f (𝜑 → Rel 𝐹)
Assertion
Ref Expression
oprssdmm (𝜑 → (𝑆 × 𝑆) ⊆ dom 𝐹)
Distinct variable groups:   𝑢,𝐹,𝑣,𝑥,𝑦   𝑢,𝑆,𝑥,𝑦   𝜑,𝑢,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑣)   𝑆(𝑣)

Proof of Theorem oprssdmm
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 elxp6 6067 . . . . . . 7 (𝑧 ∈ (𝑆 × 𝑆) ↔ (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑆)))
21biimpi 119 . . . . . 6 (𝑧 ∈ (𝑆 × 𝑆) → (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑆)))
32adantl 275 . . . . 5 ((𝜑𝑧 ∈ (𝑆 × 𝑆)) → (𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩ ∧ ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑆)))
43simpld 111 . . . 4 ((𝜑𝑧 ∈ (𝑆 × 𝑆)) → 𝑧 = ⟨(1st𝑧), (2nd𝑧)⟩)
53simprd 113 . . . . 5 ((𝜑𝑧 ∈ (𝑆 × 𝑆)) → ((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑆))
6 oprssdmm.f . . . . . . . . 9 (𝜑 → Rel 𝐹)
76adantr 274 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → Rel 𝐹)
8 eleq2 2203 . . . . . . . . . 10 (𝑢 = (𝐹‘⟨𝑥, 𝑦⟩) → (𝑣𝑢𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)))
98exbidv 1797 . . . . . . . . 9 (𝑢 = (𝐹‘⟨𝑥, 𝑦⟩) → (∃𝑣 𝑣𝑢 ↔ ∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)))
10 oprssdmm.m . . . . . . . . . . 11 ((𝜑𝑢𝑆) → ∃𝑣 𝑣𝑢)
1110ralrimiva 2505 . . . . . . . . . 10 (𝜑 → ∀𝑢𝑆𝑣 𝑣𝑢)
1211adantr 274 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → ∀𝑢𝑆𝑣 𝑣𝑢)
13 df-ov 5777 . . . . . . . . . 10 (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
14 oprssdmm.cl . . . . . . . . . 10 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥𝐹𝑦) ∈ 𝑆)
1513, 14eqeltrrid 2227 . . . . . . . . 9 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝐹‘⟨𝑥, 𝑦⟩) ∈ 𝑆)
169, 12, 15rspcdva 2794 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → ∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩))
17 relelfvdm 5453 . . . . . . . . . 10 ((Rel 𝐹𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩)) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
1817ex 114 . . . . . . . . 9 (Rel 𝐹 → (𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹))
1918exlimdv 1791 . . . . . . . 8 (Rel 𝐹 → (∃𝑣 𝑣 ∈ (𝐹‘⟨𝑥, 𝑦⟩) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹))
207, 16, 19sylc 62 . . . . . . 7 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → ⟨𝑥, 𝑦⟩ ∈ dom 𝐹)
2120ralrimivva 2514 . . . . . 6 (𝜑 → ∀𝑥𝑆𝑦𝑆𝑥, 𝑦⟩ ∈ dom 𝐹)
2221adantr 274 . . . . 5 ((𝜑𝑧 ∈ (𝑆 × 𝑆)) → ∀𝑥𝑆𝑦𝑆𝑥, 𝑦⟩ ∈ dom 𝐹)
23 opeq1 3705 . . . . . . 7 (𝑥 = (1st𝑧) → ⟨𝑥, 𝑦⟩ = ⟨(1st𝑧), 𝑦⟩)
2423eleq1d 2208 . . . . . 6 (𝑥 = (1st𝑧) → (⟨𝑥, 𝑦⟩ ∈ dom 𝐹 ↔ ⟨(1st𝑧), 𝑦⟩ ∈ dom 𝐹))
25 opeq2 3706 . . . . . . 7 (𝑦 = (2nd𝑧) → ⟨(1st𝑧), 𝑦⟩ = ⟨(1st𝑧), (2nd𝑧)⟩)
2625eleq1d 2208 . . . . . 6 (𝑦 = (2nd𝑧) → (⟨(1st𝑧), 𝑦⟩ ∈ dom 𝐹 ↔ ⟨(1st𝑧), (2nd𝑧)⟩ ∈ dom 𝐹))
2724, 26rspc2va 2803 . . . . 5 ((((1st𝑧) ∈ 𝑆 ∧ (2nd𝑧) ∈ 𝑆) ∧ ∀𝑥𝑆𝑦𝑆𝑥, 𝑦⟩ ∈ dom 𝐹) → ⟨(1st𝑧), (2nd𝑧)⟩ ∈ dom 𝐹)
285, 22, 27syl2anc 408 . . . 4 ((𝜑𝑧 ∈ (𝑆 × 𝑆)) → ⟨(1st𝑧), (2nd𝑧)⟩ ∈ dom 𝐹)
294, 28eqeltrd 2216 . . 3 ((𝜑𝑧 ∈ (𝑆 × 𝑆)) → 𝑧 ∈ dom 𝐹)
3029ex 114 . 2 (𝜑 → (𝑧 ∈ (𝑆 × 𝑆) → 𝑧 ∈ dom 𝐹))
3130ssrdv 3103 1 (𝜑 → (𝑆 × 𝑆) ⊆ dom 𝐹)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1331  wex 1468  wcel 1480  wral 2416  wss 3071  cop 3530   × cxp 4537  dom cdm 4539  Rel wrel 4544  cfv 5123  (class class class)co 5774  1st c1st 6036  2nd c2nd 6037
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-sbc 2910  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-iota 5088  df-fun 5125  df-fv 5131  df-ov 5777  df-1st 6038  df-2nd 6039
This theorem is referenced by:  axaddf  7679  axmulf  7680
  Copyright terms: Public domain W3C validator