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

Theorem 2ndconst 5870
 Description: The mapping of a restriction of the 2nd function to a converse constant function. (Contributed by NM, 27-Mar-2008.)
Assertion
Ref Expression
2ndconst (𝐴𝑉 → (2nd ↾ ({𝐴} × 𝐵)):({𝐴} × 𝐵)–1-1-onto𝐵)

Proof of Theorem 2ndconst
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 snmg 3513 . . 3 (𝐴𝑉 → ∃𝑥 𝑥 ∈ {𝐴})
2 fo2ndresm 5816 . . 3 (∃𝑥 𝑥 ∈ {𝐴} → (2nd ↾ ({𝐴} × 𝐵)):({𝐴} × 𝐵)–onto𝐵)
31, 2syl 14 . 2 (𝐴𝑉 → (2nd ↾ ({𝐴} × 𝐵)):({𝐴} × 𝐵)–onto𝐵)
4 moeq 2738 . . . . . 6 ∃*𝑥 𝑥 = ⟨𝐴, 𝑦
54moani 1986 . . . . 5 ∃*𝑥(𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)
6 vex 2577 . . . . . . . 8 𝑦 ∈ V
76brres 4645 . . . . . . 7 (𝑥(2nd ↾ ({𝐴} × 𝐵))𝑦 ↔ (𝑥2nd 𝑦𝑥 ∈ ({𝐴} × 𝐵)))
8 fo2nd 5812 . . . . . . . . . . 11 2nd :V–onto→V
9 fofn 5135 . . . . . . . . . . 11 (2nd :V–onto→V → 2nd Fn V)
108, 9ax-mp 7 . . . . . . . . . 10 2nd Fn V
11 vex 2577 . . . . . . . . . 10 𝑥 ∈ V
12 fnbrfvb 5241 . . . . . . . . . 10 ((2nd Fn V ∧ 𝑥 ∈ V) → ((2nd𝑥) = 𝑦𝑥2nd 𝑦))
1310, 11, 12mp2an 410 . . . . . . . . 9 ((2nd𝑥) = 𝑦𝑥2nd 𝑦)
1413anbi1i 439 . . . . . . . 8 (((2nd𝑥) = 𝑦𝑥 ∈ ({𝐴} × 𝐵)) ↔ (𝑥2nd 𝑦𝑥 ∈ ({𝐴} × 𝐵)))
15 elxp7 5824 . . . . . . . . . . 11 (𝑥 ∈ ({𝐴} × 𝐵) ↔ (𝑥 ∈ (V × V) ∧ ((1st𝑥) ∈ {𝐴} ∧ (2nd𝑥) ∈ 𝐵)))
16 eleq1 2116 . . . . . . . . . . . . . . 15 ((2nd𝑥) = 𝑦 → ((2nd𝑥) ∈ 𝐵𝑦𝐵))
1716biimpa 284 . . . . . . . . . . . . . 14 (((2nd𝑥) = 𝑦 ∧ (2nd𝑥) ∈ 𝐵) → 𝑦𝐵)
1817adantrl 455 . . . . . . . . . . . . 13 (((2nd𝑥) = 𝑦 ∧ ((1st𝑥) ∈ {𝐴} ∧ (2nd𝑥) ∈ 𝐵)) → 𝑦𝐵)
1918adantrl 455 . . . . . . . . . . . 12 (((2nd𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ ((1st𝑥) ∈ {𝐴} ∧ (2nd𝑥) ∈ 𝐵))) → 𝑦𝐵)
20 elsni 3420 . . . . . . . . . . . . . 14 ((1st𝑥) ∈ {𝐴} → (1st𝑥) = 𝐴)
21 eqopi 5825 . . . . . . . . . . . . . . . 16 ((𝑥 ∈ (V × V) ∧ ((1st𝑥) = 𝐴 ∧ (2nd𝑥) = 𝑦)) → 𝑥 = ⟨𝐴, 𝑦⟩)
2221ancom2s 508 . . . . . . . . . . . . . . 15 ((𝑥 ∈ (V × V) ∧ ((2nd𝑥) = 𝑦 ∧ (1st𝑥) = 𝐴)) → 𝑥 = ⟨𝐴, 𝑦⟩)
2322an12s 507 . . . . . . . . . . . . . 14 (((2nd𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ (1st𝑥) = 𝐴)) → 𝑥 = ⟨𝐴, 𝑦⟩)
2420, 23sylanr2 391 . . . . . . . . . . . . 13 (((2nd𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ (1st𝑥) ∈ {𝐴})) → 𝑥 = ⟨𝐴, 𝑦⟩)
2524adantrrr 464 . . . . . . . . . . . 12 (((2nd𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ ((1st𝑥) ∈ {𝐴} ∧ (2nd𝑥) ∈ 𝐵))) → 𝑥 = ⟨𝐴, 𝑦⟩)
2619, 25jca 294 . . . . . . . . . . 11 (((2nd𝑥) = 𝑦 ∧ (𝑥 ∈ (V × V) ∧ ((1st𝑥) ∈ {𝐴} ∧ (2nd𝑥) ∈ 𝐵))) → (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩))
2715, 26sylan2b 275 . . . . . . . . . 10 (((2nd𝑥) = 𝑦𝑥 ∈ ({𝐴} × 𝐵)) → (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩))
2827adantl 266 . . . . . . . . 9 ((𝐴𝑉 ∧ ((2nd𝑥) = 𝑦𝑥 ∈ ({𝐴} × 𝐵))) → (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩))
29 fveq2 5205 . . . . . . . . . . . 12 (𝑥 = ⟨𝐴, 𝑦⟩ → (2nd𝑥) = (2nd ‘⟨𝐴, 𝑦⟩))
30 op2ndg 5805 . . . . . . . . . . . . 13 ((𝐴𝑉𝑦 ∈ V) → (2nd ‘⟨𝐴, 𝑦⟩) = 𝑦)
316, 30mpan2 409 . . . . . . . . . . . 12 (𝐴𝑉 → (2nd ‘⟨𝐴, 𝑦⟩) = 𝑦)
3229, 31sylan9eqr 2110 . . . . . . . . . . 11 ((𝐴𝑉𝑥 = ⟨𝐴, 𝑦⟩) → (2nd𝑥) = 𝑦)
3332adantrl 455 . . . . . . . . . 10 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → (2nd𝑥) = 𝑦)
34 simprr 492 . . . . . . . . . . 11 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → 𝑥 = ⟨𝐴, 𝑦⟩)
35 snidg 3427 . . . . . . . . . . . . 13 (𝐴𝑉𝐴 ∈ {𝐴})
3635adantr 265 . . . . . . . . . . . 12 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → 𝐴 ∈ {𝐴})
37 simprl 491 . . . . . . . . . . . 12 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → 𝑦𝐵)
38 opelxpi 4403 . . . . . . . . . . . 12 ((𝐴 ∈ {𝐴} ∧ 𝑦𝐵) → ⟨𝐴, 𝑦⟩ ∈ ({𝐴} × 𝐵))
3936, 37, 38syl2anc 397 . . . . . . . . . . 11 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → ⟨𝐴, 𝑦⟩ ∈ ({𝐴} × 𝐵))
4034, 39eqeltrd 2130 . . . . . . . . . 10 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → 𝑥 ∈ ({𝐴} × 𝐵))
4133, 40jca 294 . . . . . . . . 9 ((𝐴𝑉 ∧ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)) → ((2nd𝑥) = 𝑦𝑥 ∈ ({𝐴} × 𝐵)))
4228, 41impbida 538 . . . . . . . 8 (𝐴𝑉 → (((2nd𝑥) = 𝑦𝑥 ∈ ({𝐴} × 𝐵)) ↔ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)))
4314, 42syl5bbr 187 . . . . . . 7 (𝐴𝑉 → ((𝑥2nd 𝑦𝑥 ∈ ({𝐴} × 𝐵)) ↔ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)))
447, 43syl5bb 185 . . . . . 6 (𝐴𝑉 → (𝑥(2nd ↾ ({𝐴} × 𝐵))𝑦 ↔ (𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)))
4544mobidv 1952 . . . . 5 (𝐴𝑉 → (∃*𝑥 𝑥(2nd ↾ ({𝐴} × 𝐵))𝑦 ↔ ∃*𝑥(𝑦𝐵𝑥 = ⟨𝐴, 𝑦⟩)))
465, 45mpbiri 161 . . . 4 (𝐴𝑉 → ∃*𝑥 𝑥(2nd ↾ ({𝐴} × 𝐵))𝑦)
4746alrimiv 1770 . . 3 (𝐴𝑉 → ∀𝑦∃*𝑥 𝑥(2nd ↾ ({𝐴} × 𝐵))𝑦)
48 funcnv2 4986 . . 3 (Fun (2nd ↾ ({𝐴} × 𝐵)) ↔ ∀𝑦∃*𝑥 𝑥(2nd ↾ ({𝐴} × 𝐵))𝑦)
4947, 48sylibr 141 . 2 (𝐴𝑉 → Fun (2nd ↾ ({𝐴} × 𝐵)))
50 dff1o3 5159 . 2 ((2nd ↾ ({𝐴} × 𝐵)):({𝐴} × 𝐵)–1-1-onto𝐵 ↔ ((2nd ↾ ({𝐴} × 𝐵)):({𝐴} × 𝐵)–onto𝐵 ∧ Fun (2nd ↾ ({𝐴} × 𝐵))))
513, 49, 50sylanbrc 402 1 (𝐴𝑉 → (2nd ↾ ({𝐴} × 𝐵)):({𝐴} × 𝐵)–1-1-onto𝐵)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 101   ↔ wb 102  ∀wal 1257   = wceq 1259  ∃wex 1397   ∈ wcel 1409  ∃*wmo 1917  Vcvv 2574  {csn 3402  ⟨cop 3405   class class class wbr 3791   × cxp 4370  ◡ccnv 4371   ↾ cres 4374  Fun wfun 4923   Fn wfn 4924  –onto→wfo 4927  –1-1-onto→wf1o 4928  ‘cfv 4929  1st c1st 5792  2nd c2nd 5793 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-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-13 1420  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971  ax-un 4197 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-eu 1919  df-mo 1920  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-rab 2332  df-v 2576  df-sbc 2787  df-csb 2880  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-uni 3608  df-iun 3686  df-br 3792  df-opab 3846  df-mpt 3847  df-id 4057  df-xp 4378  df-rel 4379  df-cnv 4380  df-co 4381  df-dm 4382  df-rn 4383  df-res 4384  df-ima 4385  df-iota 4894  df-fun 4931  df-fn 4932  df-f 4933  df-f1 4934  df-fo 4935  df-f1o 4936  df-fv 4937  df-1st 5794  df-2nd 5795 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator