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

Theorem mpof1o2d 8093
Description: Sufficient condition for a binary function expressed in maps-to notation to be bijective. (Contributed by SN, 11-Mar-2025.)
Hypotheses
Ref Expression
mpof1o2d.f 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
mpof1o2d.r ((𝜑 ∧ (𝑥𝐴𝑦𝐵)) → 𝐶𝐷)
mpof1o2d.i ((𝜑𝑧𝐷) → 𝐼𝐴)
mpof1o2d.j ((𝜑𝑧𝐷) → 𝐽𝐵)
mpof1o2d.1 ((𝜑 ∧ ((𝑥𝐴𝑦𝐵) ∧ 𝑧𝐷)) → ((𝑥 = 𝐼𝑦 = 𝐽) ↔ 𝑧 = 𝐶))
Assertion
Ref Expression
mpof1o2d (𝜑𝐹:(𝐴 × 𝐵)–1-1-onto𝐷)
Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑧,𝐶   𝑥,𝐷,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧   𝑥,𝐼,𝑦   𝑥,𝐽,𝑦
Allowed substitution hints:   𝐶(𝑥,𝑦)   𝐹(𝑥,𝑦,𝑧)   𝐼(𝑧)   𝐽(𝑧)

Proof of Theorem mpof1o2d
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 mpof1o2d.f . . 3 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
2 mpompts 8035 . . 3 (𝑥𝐴, 𝑦𝐵𝐶) = (𝑤 ∈ (𝐴 × 𝐵) ↦ (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶)
31, 2eqtri 2779 . 2 𝐹 = (𝑤 ∈ (𝐴 × 𝐵) ↦ (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶)
4 xp1st 7991 . . 3 (𝑤 ∈ (𝐴 × 𝐵) → (1st𝑤) ∈ 𝐴)
5 xp2nd 7992 . . . . . 6 (𝑤 ∈ (𝐴 × 𝐵) → (2nd𝑤) ∈ 𝐵)
6 mpof1o2d.r . . . . . . . 8 ((𝜑 ∧ (𝑥𝐴𝑦𝐵)) → 𝐶𝐷)
76anassrs 470 . . . . . . 7 (((𝜑𝑥𝐴) ∧ 𝑦𝐵) → 𝐶𝐷)
87ralrimiva 3148 . . . . . 6 ((𝜑𝑥𝐴) → ∀𝑦𝐵 𝐶𝐷)
9 rspcsbela 4386 . . . . . 6 (((2nd𝑤) ∈ 𝐵 ∧ ∀𝑦𝐵 𝐶𝐷) → (2nd𝑤) / 𝑦𝐶𝐷)
105, 8, 9syl2anr 605 . . . . 5 (((𝜑𝑥𝐴) ∧ 𝑤 ∈ (𝐴 × 𝐵)) → (2nd𝑤) / 𝑦𝐶𝐷)
1110an32s 660 . . . 4 (((𝜑𝑤 ∈ (𝐴 × 𝐵)) ∧ 𝑥𝐴) → (2nd𝑤) / 𝑦𝐶𝐷)
1211ralrimiva 3148 . . 3 ((𝜑𝑤 ∈ (𝐴 × 𝐵)) → ∀𝑥𝐴 (2nd𝑤) / 𝑦𝐶𝐷)
13 rspcsbela 4386 . . 3 (((1st𝑤) ∈ 𝐴 ∧ ∀𝑥𝐴 (2nd𝑤) / 𝑦𝐶𝐷) → (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶𝐷)
144, 12, 13syl2an2 694 . 2 ((𝜑𝑤 ∈ (𝐴 × 𝐵)) → (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶𝐷)
15 mpof1o2d.i . . 3 ((𝜑𝑧𝐷) → 𝐼𝐴)
16 mpof1o2d.j . . 3 ((𝜑𝑧𝐷) → 𝐽𝐵)
1715, 16opelxpd 5679 . 2 ((𝜑𝑧𝐷) → ⟨𝐼, 𝐽⟩ ∈ (𝐴 × 𝐵))
185ad2antrl 736 . . . . 5 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → (2nd𝑤) ∈ 𝐵)
19 sbceq2g 4367 . . . . 5 ((2nd𝑤) ∈ 𝐵 → ([(2nd𝑤) / 𝑦]𝑧 = 𝐶𝑧 = (2nd𝑤) / 𝑦𝐶))
2018, 19syl 17 . . . 4 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → ([(2nd𝑤) / 𝑦]𝑧 = 𝐶𝑧 = (2nd𝑤) / 𝑦𝐶))
2120sbcbidv 3794 . . 3 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝑧 = 𝐶[(1st𝑤) / 𝑥]𝑧 = (2nd𝑤) / 𝑦𝐶))
224ad2antrl 736 . . . 4 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → (1st𝑤) ∈ 𝐴)
2318adantr 483 . . . . 5 (((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) ∧ 𝑥 = (1st𝑤)) → (2nd𝑤) ∈ 𝐵)
24 eqop 8001 . . . . . . . . 9 (𝑤 ∈ (𝐴 × 𝐵) → (𝑤 = ⟨𝐼, 𝐽⟩ ↔ ((1st𝑤) = 𝐼 ∧ (2nd𝑤) = 𝐽)))
2524ad2antrl 736 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → (𝑤 = ⟨𝐼, 𝐽⟩ ↔ ((1st𝑤) = 𝐼 ∧ (2nd𝑤) = 𝐽)))
26 eqeq1 2760 . . . . . . . . . 10 (𝑥 = (1st𝑤) → (𝑥 = 𝐼 ↔ (1st𝑤) = 𝐼))
27 eqeq1 2760 . . . . . . . . . 10 (𝑦 = (2nd𝑤) → (𝑦 = 𝐽 ↔ (2nd𝑤) = 𝐽))
2826, 27bi2anan9 646 . . . . . . . . 9 ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → ((𝑥 = 𝐼𝑦 = 𝐽) ↔ ((1st𝑤) = 𝐼 ∧ (2nd𝑤) = 𝐽)))
2928bicomd 225 . . . . . . . 8 ((𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → (((1st𝑤) = 𝐼 ∧ (2nd𝑤) = 𝐽) ↔ (𝑥 = 𝐼𝑦 = 𝐽)))
3025, 29sylan9bb 516 . . . . . . 7 (((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → (𝑤 = ⟨𝐼, 𝐽⟩ ↔ (𝑥 = 𝐼𝑦 = 𝐽)))
3130anassrs 470 . . . . . 6 ((((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) ∧ 𝑥 = (1st𝑤)) ∧ 𝑦 = (2nd𝑤)) → (𝑤 = ⟨𝐼, 𝐽⟩ ↔ (𝑥 = 𝐼𝑦 = 𝐽)))
32 eleq1 2844 . . . . . . . . . . . . . 14 (𝑥 = (1st𝑤) → (𝑥𝐴 ↔ (1st𝑤) ∈ 𝐴))
334, 32syl5ibrcom 249 . . . . . . . . . . . . 13 (𝑤 ∈ (𝐴 × 𝐵) → (𝑥 = (1st𝑤) → 𝑥𝐴))
3433imp 409 . . . . . . . . . . . 12 ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑥 = (1st𝑤)) → 𝑥𝐴)
35 eleq1 2844 . . . . . . . . . . . . . 14 (𝑦 = (2nd𝑤) → (𝑦𝐵 ↔ (2nd𝑤) ∈ 𝐵))
365, 35syl5ibrcom 249 . . . . . . . . . . . . 13 (𝑤 ∈ (𝐴 × 𝐵) → (𝑦 = (2nd𝑤) → 𝑦𝐵))
3736imp 409 . . . . . . . . . . . 12 ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑦 = (2nd𝑤)) → 𝑦𝐵)
3834, 37anim12dan 627 . . . . . . . . . . 11 ((𝑤 ∈ (𝐴 × 𝐵) ∧ (𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → (𝑥𝐴𝑦𝐵))
39383impb 1123 . . . . . . . . . 10 ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → (𝑥𝐴𝑦𝐵))
40393adant1r 1187 . . . . . . . . 9 (((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷) ∧ 𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → (𝑥𝐴𝑦𝐵))
41 simp1r 1208 . . . . . . . . 9 (((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷) ∧ 𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → 𝑧𝐷)
4240, 41jca 518 . . . . . . . 8 (((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷) ∧ 𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤)) → ((𝑥𝐴𝑦𝐵) ∧ 𝑧𝐷))
43 mpof1o2d.1 . . . . . . . 8 ((𝜑 ∧ ((𝑥𝐴𝑦𝐵) ∧ 𝑧𝐷)) → ((𝑥 = 𝐼𝑦 = 𝐽) ↔ 𝑧 = 𝐶))
4442, 43sylan2 601 . . . . . . 7 ((𝜑 ∧ ((𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷) ∧ 𝑥 = (1st𝑤) ∧ 𝑦 = (2nd𝑤))) → ((𝑥 = 𝐼𝑦 = 𝐽) ↔ 𝑧 = 𝐶))
45443anassrs 1370 . . . . . 6 ((((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) ∧ 𝑥 = (1st𝑤)) ∧ 𝑦 = (2nd𝑤)) → ((𝑥 = 𝐼𝑦 = 𝐽) ↔ 𝑧 = 𝐶))
4631, 45bitr2d 282 . . . . 5 ((((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) ∧ 𝑥 = (1st𝑤)) ∧ 𝑦 = (2nd𝑤)) → (𝑧 = 𝐶𝑤 = ⟨𝐼, 𝐽⟩))
4723, 46sbcied 3782 . . . 4 (((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) ∧ 𝑥 = (1st𝑤)) → ([(2nd𝑤) / 𝑦]𝑧 = 𝐶𝑤 = ⟨𝐼, 𝐽⟩))
4822, 47sbcied 3782 . . 3 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → ([(1st𝑤) / 𝑥][(2nd𝑤) / 𝑦]𝑧 = 𝐶𝑤 = ⟨𝐼, 𝐽⟩))
49 sbceq2g 4367 . . . 4 ((1st𝑤) ∈ 𝐴 → ([(1st𝑤) / 𝑥]𝑧 = (2nd𝑤) / 𝑦𝐶𝑧 = (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶))
5022, 49syl 17 . . 3 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → ([(1st𝑤) / 𝑥]𝑧 = (2nd𝑤) / 𝑦𝐶𝑧 = (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶))
5121, 48, 503bitr3d 311 . 2 ((𝜑 ∧ (𝑤 ∈ (𝐴 × 𝐵) ∧ 𝑧𝐷)) → (𝑤 = ⟨𝐼, 𝐽⟩ ↔ 𝑧 = (1st𝑤) / 𝑥(2nd𝑤) / 𝑦𝐶))
523, 14, 17, 51f1o2d 7639 1 (𝜑𝐹:(𝐴 × 𝐵)–1-1-onto𝐷)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1095   = wceq 1554  wcel 2136  wral 3070  [wsbc 3739  csb 3847  cop 4582  cmpt 5175   × cxp 5638  1-1-ontowf1o 6509  cfv 6510  cmpo 7387  1st c1st 7957  2nd c2nd 7958
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-nul 5250  ax-pr 5384  ax-un 7707
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4945  df-br 5095  df-opab 5157  df-mpt 5176  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-oprab 7389  df-mpo 7390  df-1st 7959  df-2nd 7960
This theorem is referenced by:  evlselvlem  43118
  Copyright terms: Public domain W3C validator