![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > inl11 | GIF version |
Description: Left injection is one-to-one. (Contributed by Jim Kingdon, 12-Jul-2023.) |
Ref | Expression |
---|---|
inl11 | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((inl‘𝐴) = (inl‘𝐵) ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-inl 7108 | . . . 4 ⊢ inl = (𝑥 ∈ V ↦ 〈∅, 𝑥〉) | |
2 | opeq2 3806 | . . . 4 ⊢ (𝑥 = 𝐴 → 〈∅, 𝑥〉 = 〈∅, 𝐴〉) | |
3 | elex 2771 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
4 | 3 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐴 ∈ V) |
5 | 0ex 4157 | . . . . 5 ⊢ ∅ ∈ V | |
6 | simpl 109 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐴 ∈ 𝑉) | |
7 | opexg 4258 | . . . . 5 ⊢ ((∅ ∈ V ∧ 𝐴 ∈ 𝑉) → 〈∅, 𝐴〉 ∈ V) | |
8 | 5, 6, 7 | sylancr 414 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈∅, 𝐴〉 ∈ V) |
9 | 1, 2, 4, 8 | fvmptd3 5652 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (inl‘𝐴) = 〈∅, 𝐴〉) |
10 | opeq2 3806 | . . . 4 ⊢ (𝑥 = 𝐵 → 〈∅, 𝑥〉 = 〈∅, 𝐵〉) | |
11 | elex 2771 | . . . . 5 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
12 | 11 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 𝐵 ∈ V) |
13 | 5 | a1i 9 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∅ ∈ V) |
14 | opexg 4258 | . . . . 5 ⊢ ((∅ ∈ V ∧ 𝐵 ∈ 𝑊) → 〈∅, 𝐵〉 ∈ V) | |
15 | 13, 14 | sylancom 420 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → 〈∅, 𝐵〉 ∈ V) |
16 | 1, 10, 12, 15 | fvmptd3 5652 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (inl‘𝐵) = 〈∅, 𝐵〉) |
17 | 9, 16 | eqeq12d 2208 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((inl‘𝐴) = (inl‘𝐵) ↔ 〈∅, 𝐴〉 = 〈∅, 𝐵〉)) |
18 | opthg 4268 | . . . . 5 ⊢ ((∅ ∈ V ∧ 𝐴 ∈ 𝑉) → (〈∅, 𝐴〉 = 〈∅, 𝐵〉 ↔ (∅ = ∅ ∧ 𝐴 = 𝐵))) | |
19 | 5, 18 | mpan 424 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (〈∅, 𝐴〉 = 〈∅, 𝐵〉 ↔ (∅ = ∅ ∧ 𝐴 = 𝐵))) |
20 | eqid 2193 | . . . . 5 ⊢ ∅ = ∅ | |
21 | 20 | biantrur 303 | . . . 4 ⊢ (𝐴 = 𝐵 ↔ (∅ = ∅ ∧ 𝐴 = 𝐵)) |
22 | 19, 21 | bitr4di 198 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (〈∅, 𝐴〉 = 〈∅, 𝐵〉 ↔ 𝐴 = 𝐵)) |
23 | 22 | adantr 276 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (〈∅, 𝐴〉 = 〈∅, 𝐵〉 ↔ 𝐴 = 𝐵)) |
24 | 17, 23 | bitrd 188 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((inl‘𝐴) = (inl‘𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 Vcvv 2760 ∅c0 3447 〈cop 3622 ‘cfv 5255 inlcinl 7106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-iota 5216 df-fun 5257 df-fv 5263 df-inl 7108 |
This theorem is referenced by: omp1eomlem 7155 difinfsnlem 7160 |
Copyright terms: Public domain | W3C validator |